./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.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_test14.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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:06,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:06,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:06,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:06,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:06,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:06,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:06,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:06,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:06,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:06,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:06,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:06,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:06,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:06,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:06,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:06,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:06,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:06,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:06,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:06,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:06,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:06,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:06,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:06,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:06,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:06,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:06,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:06,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:06,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:06,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:06,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:06,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:06,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:06,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:06,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:06,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:06,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:06,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:06,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:06,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:06,955 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:50:06,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:06,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:06,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:06,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:06,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:06,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:06,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:06,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:06,993 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:06,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:06,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:06,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:06,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:06,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:06,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:06,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:06,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:06,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:06,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:06,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:06,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:06,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:06,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:06,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:50:06,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:50:06,997 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 -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2022-02-20 23:50:07,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:07,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:07,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:07,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:07,256 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:07,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2022-02-20 23:50:07,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5cba8aa/730d77c72d4144e48cb783b3bb374ad0/FLAG04bd2b4bf [2022-02-20 23:50:07,834 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:07,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2022-02-20 23:50:07,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5cba8aa/730d77c72d4144e48cb783b3bb374ad0/FLAG04bd2b4bf [2022-02-20 23:50:08,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5cba8aa/730d77c72d4144e48cb783b3bb374ad0 [2022-02-20 23:50:08,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:08,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:08,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:08,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:08,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:08,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:08" (1/1) ... [2022-02-20 23:50:08,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4191e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:08, skipping insertion in model container [2022-02-20 23:50:08,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:08" (1/1) ... [2022-02-20 23:50:08,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:08,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:08,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:08,793 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:50:08,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@153c5248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:08, skipping insertion in model container [2022-02-20 23:50:08,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:08,802 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:50:08,805 INFO L158 Benchmark]: Toolchain (without parser) took 472.59ms. Allocated memory is still 86.0MB. Free memory was 53.4MB in the beginning and 64.5MB in the end (delta: -11.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-20 23:50:08,806 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 86.0MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:08,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.74ms. Allocated memory is still 86.0MB. Free memory was 53.3MB in the beginning and 64.5MB in the end (delta: -11.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-20 23:50:08,809 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.10ms. Allocated memory is still 86.0MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.74ms. Allocated memory is still 86.0MB. Free memory was 53.3MB in the beginning and 64.5MB in the end (delta: -11.2MB). Peak memory consumption was 17.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_test14.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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:10,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:10,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:10,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:10,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:10,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:10,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:10,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:10,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:10,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:10,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:10,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:10,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:10,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:10,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:10,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:10,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:10,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:10,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:10,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:10,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:10,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:10,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:10,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:10,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:10,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:10,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:10,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:10,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:10,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:10,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:10,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:10,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:10,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:10,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:10,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:10,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:10,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:10,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:10,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:10,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:10,702 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:50:10,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:10,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:10,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:10,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:10,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:10,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:10,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:10,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:10,740 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:10,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:10,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:10,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:10,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:10,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:10,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:10,743 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:50:10,743 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:50:10,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:10,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:10,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:10,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:10,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:10,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:10,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:10,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:10,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:50:10,749 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:10,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:50:10,750 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2022-02-20 23:50:11,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:11,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:11,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:11,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:11,083 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:11,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2022-02-20 23:50:11,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edde6c7d4/9d714d7463a64d30b7fe1b20413b513e/FLAG956704765 [2022-02-20 23:50:11,702 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:11,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2022-02-20 23:50:11,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edde6c7d4/9d714d7463a64d30b7fe1b20413b513e/FLAG956704765 [2022-02-20 23:50:12,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edde6c7d4/9d714d7463a64d30b7fe1b20413b513e [2022-02-20 23:50:12,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:12,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:12,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:12,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:12,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:12,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35281e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12, skipping insertion in model container [2022-02-20 23:50:12,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:12,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:12,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:12,569 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:50:12,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:12,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:12,656 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:50:12,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:12,782 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:50:12,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12 WrapperNode [2022-02-20 23:50:12,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:12,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:12,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:50:12,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:50:12,791 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:50:12" (1/1) ... [2022-02-20 23:50:12,820 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:50:12" (1/1) ... [2022-02-20 23:50:12,840 INFO L137 Inliner]: procedures = 168, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 59 [2022-02-20 23:50:12,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:12,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:50:12,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:50:12,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:50:12,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:50:12,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:50:12,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:50:12,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:50:12,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (1/1) ... [2022-02-20 23:50:12,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:12,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:50:12,926 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:50:12,936 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:50:12,963 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-02-20 23:50:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-02-20 23:50:12,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:50:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:50:12,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2022-02-20 23:50:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2022-02-20 23:50:12,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:50:12,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:50:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2022-02-20 23:50:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2022-02-20 23:50:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:50:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:50:13,138 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:50:13,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:50:13,487 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:50:13,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:50:13,494 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:50:13,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:13 BoogieIcfgContainer [2022-02-20 23:50:13,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:50:13,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:50:13,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:50:13,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:50:13,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:50:12" (1/3) ... [2022-02-20 23:50:13,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c060303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:13, skipping insertion in model container [2022-02-20 23:50:13,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:12" (2/3) ... [2022-02-20 23:50:13,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c060303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:13, skipping insertion in model container [2022-02-20 23:50:13,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:13" (3/3) ... [2022-02-20 23:50:13,501 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test14.i [2022-02-20 23:50:13,505 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:50:13,505 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-02-20 23:50:13,538 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:50:13,544 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:50:13,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-02-20 23:50:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 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:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:13,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:13,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:13,566 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash -781473750, now seen corresponding path program 1 times [2022-02-20 23:50:13,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:13,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746901161] [2022-02-20 23:50:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:13,587 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:50:13,604 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:50:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:50:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:13,777 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:13,903 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:13,904 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:13,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#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); {81#true} is VALID [2022-02-20 23:50:13,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,969 INFO L272 TraceCheckUtils]: 2: Hoare triple {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {93#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#(= |old(#valid)| |#valid|)} ~size := #in~size; {93#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {93#(= |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; {100#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:13,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {100#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:13,973 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {100#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} #99#return; {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,976 INFO L272 TraceCheckUtils]: 9: Hoare triple {89#(= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {116#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:13,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {120#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:13,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {120#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} assume !(1bv1 == #valid[~head.base]); {82#false} is VALID [2022-02-20 23:50:13,978 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:50:13,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:13,979 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:13,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746901161] [2022-02-20 23:50:13,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746901161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:13,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:13,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:13,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338839848] [2022-02-20 23:50:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:13,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:13,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:14,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:14,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:14,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:14,045 INFO L87 Difference]: Start difference. First operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,264 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:50:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-02-20 23:50:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-02-20 23:50:15,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-02-20 23:50:15,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:15,450 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:50:15,451 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:50:15,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:15,461 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:15,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 153 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 57 Unchecked, 0.4s Time] [2022-02-20 23:50:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:50:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-02-20 23:50:15,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:15,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 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,502 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 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,504 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 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,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,516 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-02-20 23:50:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-02-20 23:50:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:15,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:15,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 23:50:15,524 INFO L87 Difference]: Start difference. First operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 23:50:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,538 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-02-20 23:50:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-02-20 23:50:15,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:15,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:15,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:15,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 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,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-02-20 23:50:15,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 12 [2022-02-20 23:50:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:15,554 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-02-20 23:50:15,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 23:50:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:15,556 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:15,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:15,575 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:50:15,775 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:50:15,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -781473749, now seen corresponding path program 1 times [2022-02-20 23:50:15,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:15,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942456425] [2022-02-20 23:50:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:15,783 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:50:15,784 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:50:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:50:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:15,910 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:15,915 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:16,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:16,161 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:16,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:16,174 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 11 treesize of output 11 [2022-02-20 23:50:16,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#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); {463#true} is VALID [2022-02-20 23:50:16,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {471#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,333 INFO L272 TraceCheckUtils]: 2: Hoare triple {471#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {475#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:16,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {475#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {475#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:16,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {475#(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; {482#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_13 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))))} is VALID [2022-02-20 23:50:16,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_13 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))))} assume true; {482#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_13 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))))} is VALID [2022-02-20 23:50:16,339 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {482#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_13 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))))} {471#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)))} #99#return; {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} is VALID [2022-02-20 23:50:16,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} is VALID [2022-02-20 23:50:16,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} is VALID [2022-02-20 23:50:16,342 INFO L272 TraceCheckUtils]: 9: Hoare triple {489#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {499#(and (= (_ bv8 32) (select |#length| |ldv_list_add_#in~head.base|)) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:16,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(and (= (_ bv8 32) (select |#length| |ldv_list_add_#in~head.base|)) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {503#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| ldv_list_add_~head.base)))} is VALID [2022-02-20 23:50:16,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| ldv_list_add_~head.base)))} assume !((~bvule32(~bvadd32(4bv32, ~head.offset), #length[~head.base]) && ~bvule32(~head.offset, ~bvadd32(4bv32, ~head.offset))) && ~bvule32(0bv32, ~head.offset)); {464#false} is VALID [2022-02-20 23:50:16,344 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:50:16,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:16,344 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:16,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942456425] [2022-02-20 23:50:16,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942456425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:16,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:16,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:50:16,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774344234] [2022-02-20 23:50:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:16,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:16,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:16,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:16,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:16,366 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,061 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-02-20 23:50:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-02-20 23:50:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-02-20 23:50:22,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2022-02-20 23:50:22,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:22,217 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:50:22,217 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:50:22,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2022-02-20 23:50:22,219 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 88 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:22,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 214 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 254 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2022-02-20 23:50:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:50:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2022-02-20 23:50:22,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:22,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 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:22,225 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 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:22,226 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 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:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,230 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-02-20 23:50:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-02-20 23:50:22,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:22,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:22,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 97 states. [2022-02-20 23:50:22,232 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 97 states. [2022-02-20 23:50:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,236 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-02-20 23:50:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-02-20 23:50:22,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:22,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:22,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:22,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 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:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-02-20 23:50:22,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 12 [2022-02-20 23:50:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:22,241 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-02-20 23:50:22,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-02-20 23:50:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:50:22,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:22,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:22,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:22,455 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:50:22,456 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1410681567, now seen corresponding path program 1 times [2022-02-20 23:50:22,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:22,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456730129] [2022-02-20 23:50:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:22,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:22,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:22,459 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:50:22,464 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:50:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:22,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:22,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:22,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#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); {875#true} is VALID [2022-02-20 23:50:22,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {875#true} is VALID [2022-02-20 23:50:22,568 INFO L272 TraceCheckUtils]: 2: Hoare triple {875#true} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {875#true} is VALID [2022-02-20 23:50:22,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#true} ~size := #in~size; {875#true} is VALID [2022-02-20 23:50:22,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {875#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; {892#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:22,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {892#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {892#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:22,570 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {892#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {875#true} #99#return; {899#(not (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:22,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(not (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {903#(not (= |ULTIMATE.start_alloc_14_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:22,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {903#(not (= |ULTIMATE.start_alloc_14_~p~0#1.base| (_ bv0 32)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {876#false} is VALID [2022-02-20 23:50:22,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {876#false} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {876#false} is VALID [2022-02-20 23:50:22,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {876#false} assume !(1bv1 == #valid[free_14_~plist#1.base]); {876#false} is VALID [2022-02-20 23:50:22,572 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:50:22,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:22,572 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:22,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456730129] [2022-02-20 23:50:22,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456730129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:22,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:22,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:22,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047004819] [2022-02-20 23:50:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:22,574 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:50:22,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:22,574 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:50:22,594 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:50:22,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:22,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:22,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:22,600 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. 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:50:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,173 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-02-20 23:50:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:23,174 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:50:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:23,174 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:50:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 23:50:23,177 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:50:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 23:50:23,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-02-20 23:50:23,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:23,313 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:50:23,313 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:50:23,313 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:50:23,314 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 26 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:23,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:50:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2022-02-20 23:50:23,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:23,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:23,322 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,339 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-02-20 23:50:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-02-20 23:50:23,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 105 states. [2022-02-20 23:50:23,343 INFO L87 Difference]: Start difference. First operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 105 states. [2022-02-20 23:50:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,350 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-02-20 23:50:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-02-20 23:50:23,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:23,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-20 23:50:23,356 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 11 [2022-02-20 23:50:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:23,356 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-20 23:50:23,357 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:50:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:50:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:50:23,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:23,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:23,370 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:50:23,566 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:50:23,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -523177886, now seen corresponding path program 1 times [2022-02-20 23:50:23,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:23,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460797526] [2022-02-20 23:50:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:23,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:23,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:23,569 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:50:23,570 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:50:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:23,650 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:23,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1305#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); {1305#true} is VALID [2022-02-20 23:50:23,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:23,738 INFO L272 TraceCheckUtils]: 2: Hoare triple {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {1317#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:23,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {1317#(= |old(#valid)| |#valid|)} ~size := #in~size; {1317#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:23,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {1317#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1317#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:23,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#(= |old(#valid)| |#valid|)} assume true; {1317#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:23,741 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1317#(= |old(#valid)| |#valid|)} {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} #99#return; {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:23,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:23,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:23,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {1339#(= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:23,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {1339#(= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_14_~plist#1.base]); {1306#false} is VALID [2022-02-20 23:50:23,743 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:50:23,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:23,743 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:23,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460797526] [2022-02-20 23:50:23,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460797526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:23,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:23,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:23,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802471682] [2022-02-20 23:50:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:23,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:23,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:23,757 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:50:23,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:23,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:23,758 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,517 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-20 23:50:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-02-20 23:50:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-02-20 23:50:24,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-02-20 23:50:24,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:24,652 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:50:24,653 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:50:24,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:24,654 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:24,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 107 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:50:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2022-02-20 23:50:24,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:24,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,660 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,661 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,664 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-20 23:50:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-02-20 23:50:24,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:24,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:24,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 105 states. [2022-02-20 23:50:24,666 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 105 states. [2022-02-20 23:50:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,683 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-20 23:50:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-02-20 23:50:24,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:24,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:24,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:24,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-02-20 23:50:24,688 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2022-02-20 23:50:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:24,689 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-02-20 23:50:24,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:50:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:50:24,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:24,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:24,697 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:24,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:24,892 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -523177885, now seen corresponding path program 1 times [2022-02-20 23:50:24,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:24,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196323291] [2022-02-20 23:50:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:24,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:24,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:50:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:24,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:24,990 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:25,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1740#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); {1740#true} is VALID [2022-02-20 23:50:25,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:25,109 INFO L272 TraceCheckUtils]: 2: Hoare triple {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {1752#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:25,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {1752#(= |#length| |old(#length)|)} ~size := #in~size; {1752#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:25,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {1752#(= |#length| |old(#length)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1752#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:25,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1752#(= |#length| |old(#length)|)} assume true; {1752#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:25,115 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1752#(= |#length| |old(#length)|)} {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #99#return; {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:25,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:25,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:25,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {1748#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {1774#(and (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)))} is VALID [2022-02-20 23:50:25,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {1774#(and (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, free_14_~plist#1.offset), #length[free_14_~plist#1.base]) && ~bvule32(free_14_~plist#1.offset, ~bvadd32(4bv32, free_14_~plist#1.offset))) && ~bvule32(0bv32, free_14_~plist#1.offset)); {1741#false} is VALID [2022-02-20 23:50:25,119 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:50:25,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:25,119 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:25,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196323291] [2022-02-20 23:50:25,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196323291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:25,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:25,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:25,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709369016] [2022-02-20 23:50:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:25,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:25,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:25,133 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:50:25,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:25,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:25,134 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,027 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-02-20 23:50:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-02-20 23:50:26,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2022-02-20 23:50:26,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:26,165 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:50:26,165 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:50:26,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:26,166 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:26,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 124 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:50:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 81. [2022-02-20 23:50:26,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:26,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,171 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,172 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,175 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:50:26,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 103 states. [2022-02-20 23:50:26,176 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 103 states. [2022-02-20 23:50:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,178 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:50:26,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:26,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-02-20 23:50:26,182 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 11 [2022-02-20 23:50:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:26,182 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-02-20 23:50:26,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-02-20 23:50:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:26,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:26,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:26,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:26,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:26,392 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2133290457, now seen corresponding path program 1 times [2022-02-20 23:50:26,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:26,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137994401] [2022-02-20 23:50:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:26,394 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:26,395 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:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:50:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:26,596 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:26,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#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); {2169#true} is VALID [2022-02-20 23:50:26,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:26,644 INFO L272 TraceCheckUtils]: 2: Hoare triple {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} is VALID [2022-02-20 23:50:26,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} ~size := #in~size; {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} is VALID [2022-02-20 23:50:26,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} 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; {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} is VALID [2022-02-20 23:50:26,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} assume true; {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} is VALID [2022-02-20 23:50:26,647 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2181#(exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|)))} {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} #99#return; {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:26,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:26,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:26,648 INFO L272 TraceCheckUtils]: 9: Hoare triple {2177#(= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {2203#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} is VALID [2022-02-20 23:50:26,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {2203#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2207#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} is VALID [2022-02-20 23:50:26,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {2207#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {2211#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:26,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {2211#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {2215#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:26,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {2215#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {2219#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} is VALID [2022-02-20 23:50:26,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} assume !(1bv1 == #valid[~next.base]); {2170#false} is VALID [2022-02-20 23:50:26,652 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:50:26,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:26,652 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:26,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137994401] [2022-02-20 23:50:26,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137994401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:26,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:26,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:50:26,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774545325] [2022-02-20 23:50:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:26,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:26,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,668 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:26,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:26,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:26,675 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,016 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:50:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-02-20 23:50:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-02-20 23:50:32,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 90 transitions. [2022-02-20 23:50:32,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:32,129 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:50:32,130 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:50:32,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:50:32,131 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:32,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 363 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-02-20 23:50:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:50:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2022-02-20 23:50:32,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:32,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,139 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,140 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,144 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:50:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 23:50:32,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 93 states. [2022-02-20 23:50:32,145 INFO L87 Difference]: Start difference. First operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 93 states. [2022-02-20 23:50:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,148 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:50:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 23:50:32,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:32,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-02-20 23:50:32,151 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2022-02-20 23:50:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:32,152 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-02-20 23:50:32,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-02-20 23:50:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:32,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:32,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:32,167 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:32,361 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:32,362 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2133290458, now seen corresponding path program 1 times [2022-02-20 23:50:32,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:32,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010592478] [2022-02-20 23:50:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:32,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:32,364 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:32,366 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:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:50:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:32,495 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,505 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,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:50:32,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:50:34,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:34,759 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:34,771 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:34,772 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 11 treesize of output 11 [2022-02-20 23:50:34,974 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:34,979 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:35,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {2587#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); {2587#true} is VALID [2022-02-20 23:50:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {2587#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {2595#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} is VALID [2022-02-20 23:50:35,066 INFO L272 TraceCheckUtils]: 2: Hoare triple {2595#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {2599#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:35,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {2599#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2599#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:35,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {2599#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (= |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; {2606#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (exists ((v_ArrVal_34 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_34) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))))} is VALID [2022-02-20 23:50:35,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (exists ((v_ArrVal_34 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_34) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))))} assume true; {2606#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (exists ((v_ArrVal_34 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_34) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))))} is VALID [2022-02-20 23:50:35,071 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2606#(and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)))) (exists ((v_ArrVal_34 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_34) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))))} {2595#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_14_~list#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} #99#return; {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} is VALID [2022-02-20 23:50:35,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} is VALID [2022-02-20 23:50:35,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} is VALID [2022-02-20 23:50:35,073 INFO L272 TraceCheckUtils]: 9: Hoare triple {2613#(and (= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_14_~list#1.base|)) (= |ULTIMATE.start_alloc_14_~list#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)) (= |ULTIMATE.start_alloc_14_~list#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_14_~list#1.base|) |ULTIMATE.start_alloc_14_~list#1.offset|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {2623#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:35,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {2623#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2627#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| ldv_list_add_~head.base)) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:50:35,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {2627#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| ldv_list_add_~head.base)) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {2631#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ldv_list_add_#t~mem14.base|)))} is VALID [2022-02-20 23:50:35,075 INFO L272 TraceCheckUtils]: 12: Hoare triple {2631#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ldv_list_add_#t~mem14.base|)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {2635#(and (= (_ bv8 32) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:35,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {2635#(and (= (_ bv8 32) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {2639#(and (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| __ldv_list_add_~next.base)))} is VALID [2022-02-20 23:50:35,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(and (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| __ldv_list_add_~next.base)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)), #length[~next.base]) && ~bvule32(~bvadd32(4bv32, ~next.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~next.offset))); {2588#false} is VALID [2022-02-20 23:50:35,076 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:50:35,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:35,076 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:35,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010592478] [2022-02-20 23:50:35,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010592478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:35,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:35,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:50:35,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758671852] [2022-02-20 23:50:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:35,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:35,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,096 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:35,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:50:35,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:50:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:35,097 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:36,994 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-02-20 23:50:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:50:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-02-20 23:50:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-02-20 23:50:36,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2022-02-20 23:50:37,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:37,123 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:50:37,123 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:50:37,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2022-02-20 23:50:37,124 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 28 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:37,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 400 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 110 Unchecked, 0.6s Time] [2022-02-20 23:50:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:50:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-02-20 23:50:37,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:37,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:37,128 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:37,129 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,131 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-02-20 23:50:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-02-20 23:50:37,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 97 states. [2022-02-20 23:50:37,132 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 97 states. [2022-02-20 23:50:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,140 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-02-20 23:50:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-02-20 23:50:37,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:37,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-02-20 23:50:37,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2022-02-20 23:50:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:37,145 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-02-20 23:50:37,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-02-20 23:50:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:37,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:37,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:37,157 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:37,354 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:37,355 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 336339099, now seen corresponding path program 1 times [2022-02-20 23:50:37,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:37,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103228326] [2022-02-20 23:50:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:37,357 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:37,358 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:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:37,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:37,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:37,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {3029#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); {3029#true} is VALID [2022-02-20 23:50:37,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {3029#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {3029#true} is VALID [2022-02-20 23:50:37,502 INFO L272 TraceCheckUtils]: 2: Hoare triple {3029#true} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {3029#true} is VALID [2022-02-20 23:50:37,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {3029#true} ~size := #in~size; {3029#true} is VALID [2022-02-20 23:50:37,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {3029#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3046#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {3046#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {3046#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,504 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3046#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {3029#true} #99#return; {3053#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {3057#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {3057#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~p~0#1.base| (_ bv0 32)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {3030#false} is VALID [2022-02-20 23:50:37,505 INFO L272 TraceCheckUtils]: 9: Hoare triple {3030#false} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {3030#false} is VALID [2022-02-20 23:50:37,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {3030#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3030#false} is VALID [2022-02-20 23:50:37,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {3030#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {3030#false} is VALID [2022-02-20 23:50:37,506 INFO L272 TraceCheckUtils]: 12: Hoare triple {3030#false} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {3030#false} is VALID [2022-02-20 23:50:37,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {3030#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {3030#false} is VALID [2022-02-20 23:50:37,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {3030#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)), #length[~next.base]) && ~bvule32(~bvadd32(4bv32, ~next.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~next.offset))); {3030#false} is VALID [2022-02-20 23:50:37,506 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:50:37,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:37,506 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:37,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103228326] [2022-02-20 23:50:37,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103228326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:37,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:37,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:37,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500259765] [2022-02-20 23:50:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:37,507 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:37,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:37,507 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,521 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:37,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:37,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:37,522 INFO L87 Difference]: Start difference. First operand 90 states and 99 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,904 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-02-20 23:50:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:37,904 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:37,904 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-02-20 23:50:37,906 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-02-20 23:50:37,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 103 transitions. [2022-02-20 23:50:38,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:38,023 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:50:38,023 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:50:38,023 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:38,023 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:38,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 294 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:50:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2022-02-20 23:50:38,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:38,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:38,027 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:38,028 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,030 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-02-20 23:50:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-02-20 23:50:38,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 100 states. [2022-02-20 23:50:38,031 INFO L87 Difference]: Start difference. First operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 100 states. [2022-02-20 23:50:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,034 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-02-20 23:50:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-02-20 23:50:38,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:38,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-20 23:50:38,037 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 15 [2022-02-20 23:50:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:38,037 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-20 23:50:38,037 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:50:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:38,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:38,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:38,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:38,247 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:38,247 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -262774844, now seen corresponding path program 1 times [2022-02-20 23:50:38,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:38,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101697557] [2022-02-20 23:50:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:38,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:38,249 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:38,250 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:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:38,338 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:38,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:50:38,589 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:38,594 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:38,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {3456#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); {3456#true} is VALID [2022-02-20 23:50:38,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {3456#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:38,692 INFO L272 TraceCheckUtils]: 2: Hoare triple {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:50:38,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} ~size := #in~size; {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:50:38,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:50:38,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} assume true; {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:50:38,696 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3468#(and (= |#length| |old(#length)|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_3|) (_ bv0 32)) (_ bv0 32)))))} {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #99#return; {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:38,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:38,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:38,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3464#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {3490#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) |ULTIMATE.start_free_14_~plist#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)))} is VALID [2022-02-20 23:50:38,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {3490#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) |ULTIMATE.start_free_14_~plist#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {3494#(and (= |ULTIMATE.start_free_14_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|)))} is VALID [2022-02-20 23:50:38,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {3494#(and (= |ULTIMATE.start_free_14_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|)))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {3498#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv8 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:50:38,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {3498#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv8 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset)), #length[free_14_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_14_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset))); {3457#false} is VALID [2022-02-20 23:50:38,702 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:50:38,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:38,702 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:38,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101697557] [2022-02-20 23:50:38,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101697557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:38,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:38,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:38,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948018353] [2022-02-20 23:50:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:38,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:38,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:38,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:38,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:38,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:38,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:38,730 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:39,899 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-02-20 23:50:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-02-20 23:50:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-02-20 23:50:39,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2022-02-20 23:50:40,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:40,027 INFO L225 Difference]: With dead ends: 90 [2022-02-20 23:50:40,027 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 23:50:40,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:40,028 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:40,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 256 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-02-20 23:50:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 23:50:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-02-20 23:50:40,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:40,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:40,032 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:40,032 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,034 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-02-20 23:50:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-02-20 23:50:40,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 90 states. [2022-02-20 23:50:40,035 INFO L87 Difference]: Start difference. First operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 90 states. [2022-02-20 23:50:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,037 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-02-20 23:50:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-02-20 23:50:40,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:40,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-02-20 23:50:40,041 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 13 [2022-02-20 23:50:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:40,041 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-02-20 23:50:40,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-02-20 23:50:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:40,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:40,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:40,051 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:40,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:40,251 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash -262774845, now seen corresponding path program 1 times [2022-02-20 23:50:40,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:40,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609390682] [2022-02-20 23:50:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:40,253 INFO L229 MonitoredProcess]: Starting monitored process 11 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:40,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:50:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:50:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:40,320 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:40,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:50:40,473 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:40,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {3863#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#true} is VALID [2022-02-20 23:50:40,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {3863#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:50:40,515 INFO L272 TraceCheckUtils]: 2: Hoare triple {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} is VALID [2022-02-20 23:50:40,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} ~size := #in~size; {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} is VALID [2022-02-20 23:50:40,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} is VALID [2022-02-20 23:50:40,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} assume true; {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} is VALID [2022-02-20 23:50:40,532 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3875#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_entry_point_~#list_14~0#1.offset_BEFORE_CALL_3|))))} {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} #99#return; {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:50:40,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:50:40,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:50:40,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {3871#(and (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {3897#(and (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3897#(and (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {3901#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:40,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {3901#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {3905#(= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:40,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {3905#(= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_14_~p~1#1.base]); {3864#false} is VALID [2022-02-20 23:50:40,536 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:50:40,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:40,536 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:40,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609390682] [2022-02-20 23:50:40,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609390682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:40,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:40,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:40,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3592557] [2022-02-20 23:50:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:40,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:40,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:40,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:40,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:40,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:40,554 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,536 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-20 23:50:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-02-20 23:50:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-02-20 23:50:41,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 99 transitions. [2022-02-20 23:50:41,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,635 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:50:41,635 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:50:41,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:41,636 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:41,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 239 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 72 Unchecked, 0.3s Time] [2022-02-20 23:50:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:50:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-02-20 23:50:41,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:41,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:41,639 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:41,640 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,642 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-20 23:50:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-20 23:50:41,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 93 states. [2022-02-20 23:50:41,643 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 93 states. [2022-02-20 23:50:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,645 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-20 23:50:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-20 23:50:41,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:41,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-02-20 23:50:41,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 13 [2022-02-20 23:50:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:41,648 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-02-20 23:50:41,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-02-20 23:50:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:41,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:41,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:41,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,859 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1707494783, now seen corresponding path program 1 times [2022-02-20 23:50:41,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:41,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222229176] [2022-02-20 23:50:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:41,861 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:41,862 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:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:41,941 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:42,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {4282#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); {4282#true} is VALID [2022-02-20 23:50:42,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4282#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {4282#true} is VALID [2022-02-20 23:50:42,028 INFO L272 TraceCheckUtils]: 2: Hoare triple {4282#true} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {4282#true} is VALID [2022-02-20 23:50:42,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {4282#true} ~size := #in~size; {4282#true} is VALID [2022-02-20 23:50:42,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {4282#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; {4299#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:42,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {4299#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {4299#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:42,034 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4299#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {4282#true} #99#return; {4306#(= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:42,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {4306#(= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {4310#(= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:42,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {4310#(= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {4310#(= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:42,035 INFO L272 TraceCheckUtils]: 9: Hoare triple {4310#(= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {4317#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:42,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {4317#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4321#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:42,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {4321#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4321#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:42,037 INFO L272 TraceCheckUtils]: 12: Hoare triple {4321#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4328#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:42,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {4328#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {4332#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:42,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {4332#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4332#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:42,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {4332#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} assume !(1bv1 == #valid[~new.base]); {4283#false} is VALID [2022-02-20 23:50:42,038 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:50:42,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:42,038 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:42,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222229176] [2022-02-20 23:50:42,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222229176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:42,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:42,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:50:42,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324753190] [2022-02-20 23:50:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:42,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:42,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:42,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:42,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:42,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:42,057 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,372 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-02-20 23:50:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-02-20 23:50:43,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-02-20 23:50:43,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:43,467 INFO L225 Difference]: With dead ends: 90 [2022-02-20 23:50:43,467 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 23:50:43,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:43,468 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 39 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:43,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 326 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 23:50:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-02-20 23:50:43,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:43,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:43,471 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:43,471 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,473 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:50:43,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 90 states. [2022-02-20 23:50:43,474 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 90 states. [2022-02-20 23:50:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,476 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:50:43,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:43,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-02-20 23:50:43,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 16 [2022-02-20 23:50:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:43,482 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-02-20 23:50:43,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-02-20 23:50:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:43,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:43,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:43,495 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:43,691 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:43,691 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1707494784, now seen corresponding path program 1 times [2022-02-20 23:50:43,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:43,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964155577] [2022-02-20 23:50:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:43,693 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:43,694 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:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:43,796 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:44,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {4699#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); {4699#true} is VALID [2022-02-20 23:50:44,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {4699#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {4699#true} is VALID [2022-02-20 23:50:44,009 INFO L272 TraceCheckUtils]: 2: Hoare triple {4699#true} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {4699#true} is VALID [2022-02-20 23:50:44,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {4699#true} ~size := #in~size; {4713#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:44,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {4713#(= 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; {4717#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:44,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {4717#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {4717#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:44,012 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4717#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {4699#true} #99#return; {4724#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {4724#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {4728#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:50:44,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {4728#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {4728#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:50:44,014 INFO L272 TraceCheckUtils]: 9: Hoare triple {4728#(and (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {4735#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {4735#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4739#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:44,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {4739#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4739#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:44,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {4739#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4746#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} is VALID [2022-02-20 23:50:44,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {4746#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {4750#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {4750#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4750#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {4750#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~new.offset), #length[~new.base]) && ~bvule32(~new.offset, ~bvadd32(4bv32, ~new.offset))) && ~bvule32(0bv32, ~new.offset)); {4700#false} is VALID [2022-02-20 23:50:44,019 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:50:44,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:44,019 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:44,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964155577] [2022-02-20 23:50:44,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964155577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:44,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:44,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:44,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599440246] [2022-02-20 23:50:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:44,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:44,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:44,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:44,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:44,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:44,046 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,722 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 23:50:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 23:50:45,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-02-20 23:50:45,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,841 INFO L225 Difference]: With dead ends: 90 [2022-02-20 23:50:45,841 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 23:50:45,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:45,842 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:45,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 420 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:50:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 23:50:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-02-20 23:50:45,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:45,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:45,844 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:45,845 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,846 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:50:45,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 90 states. [2022-02-20 23:50:45,848 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 90 states. [2022-02-20 23:50:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,850 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:50:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:50:45,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:45,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-02-20 23:50:45,853 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-02-20 23:50:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:45,853 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-02-20 23:50:45,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-02-20 23:50:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:45,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:45,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:45,867 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,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,064 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __ldv_list_addErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 224981282, now seen corresponding path program 1 times [2022-02-20 23:50:46,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:46,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533901544] [2022-02-20 23:50:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:46,066 INFO L229 MonitoredProcess]: Starting monitored process 14 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,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:50:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {5117#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); {5117#true} is VALID [2022-02-20 23:50:46,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {5117#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {5117#true} is VALID [2022-02-20 23:50:46,221 INFO L272 TraceCheckUtils]: 2: Hoare triple {5117#true} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {5117#true} is VALID [2022-02-20 23:50:46,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {5117#true} ~size := #in~size; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {5117#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; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5117#true} {5117#true} #99#return; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {5117#true} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {5117#true} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {5117#true} is VALID [2022-02-20 23:50:46,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {5117#true} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {5117#true} is VALID [2022-02-20 23:50:46,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {5117#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5117#true} is VALID [2022-02-20 23:50:46,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {5117#true} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {5155#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:46,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {5155#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {5159#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:46,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {5159#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:46,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:46,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:46,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:46,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {5163#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} assume !(1bv1 == #valid[~prev.base]); {5118#false} is VALID [2022-02-20 23:50:46,229 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:50:46,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:46,229 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:46,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533901544] [2022-02-20 23:50:46,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533901544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:46,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:46,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:46,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776098499] [2022-02-20 23:50:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:46,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:46,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:46,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:46,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:46,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:46,256 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,815 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:50:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 23:50:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 23:50:46,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 23:50:46,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:46,881 INFO L225 Difference]: With dead ends: 84 [2022-02-20 23:50:46,881 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 23:50:46,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:46,882 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:46,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 171 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 23:50:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-02-20 23:50:46,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:46,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:46,885 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:46,885 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,887 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:50:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:50:46,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 84 states. [2022-02-20 23:50:46,888 INFO L87 Difference]: Start difference. First operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 84 states. [2022-02-20 23:50:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,890 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-02-20 23:50:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:50:46,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:46,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-02-20 23:50:46,892 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 18 [2022-02-20 23:50:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:46,893 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-02-20 23:50:46,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:50:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:46,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:46,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:46,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:47,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:47,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __ldv_list_addErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 224981283, now seen corresponding path program 1 times [2022-02-20 23:50:47,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:47,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935176370] [2022-02-20 23:50:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:47,105 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:47,107 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:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:50:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:47,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {5513#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); {5513#true} is VALID [2022-02-20 23:50:47,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {5513#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:47,344 INFO L272 TraceCheckUtils]: 2: Hoare triple {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {5513#true} is VALID [2022-02-20 23:50:47,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {5513#true} ~size := #in~size; {5513#true} is VALID [2022-02-20 23:50:47,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {5513#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; {5513#true} is VALID [2022-02-20 23:50:47,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {5513#true} assume true; {5513#true} is VALID [2022-02-20 23:50:47,350 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5513#true} {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} #99#return; {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:47,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:47,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:47,352 INFO L272 TraceCheckUtils]: 9: Hoare triple {5521#(= |ULTIMATE.start_alloc_14_~list#1.offset| (_ bv0 32))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {5546#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} is VALID [2022-02-20 23:50:47,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {5546#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5550#(= ldv_list_add_~head.offset (_ bv0 32))} is VALID [2022-02-20 23:50:47,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {5550#(= ldv_list_add_~head.offset (_ bv0 32))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {5554#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} is VALID [2022-02-20 23:50:47,354 INFO L272 TraceCheckUtils]: 12: Hoare triple {5554#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {5558#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} is VALID [2022-02-20 23:50:47,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {5558#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:47,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:47,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:47,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:47,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {5562#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} assume !((~bvule32(~bvadd32(4bv32, ~prev.offset), #length[~prev.base]) && ~bvule32(~prev.offset, ~bvadd32(4bv32, ~prev.offset))) && ~bvule32(0bv32, ~prev.offset)); {5514#false} is VALID [2022-02-20 23:50:47,357 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:50:47,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:47,357 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:47,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935176370] [2022-02-20 23:50:47,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935176370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:47,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:47,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:50:47,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027604291] [2022-02-20 23:50:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:47,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:47,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:47,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:47,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:47,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:47,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:47,390 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [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 83 states and 90 transitions. [2022-02-20 23:50:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-02-20 23:50:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-02-20 23:50:48,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2022-02-20 23:50:48,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:48,409 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:50:48,409 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:50:48,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:48,410 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:48,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 319 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:50:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-20 23:50:48,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:48,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:48,413 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:48,414 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,415 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-02-20 23:50:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-20 23:50:48,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 83 states. [2022-02-20 23:50:48,417 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 83 states. [2022-02-20 23:50:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,418 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-02-20 23:50:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-20 23:50:48,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:48,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-02-20 23:50:48,421 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 18 [2022-02-20 23:50:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:48,421 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-02-20 23:50:48,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-20 23:50:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:48,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:48,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:48,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-02-20 23:50:48,627 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:48,627 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1052662622, now seen corresponding path program 1 times [2022-02-20 23:50:48,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:48,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980719973] [2022-02-20 23:50:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:48,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:48,630 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:48,631 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:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:50:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:48,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:50:48,859 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-02-20 23:50:48,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:50:48,868 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-02-20 23:50:48,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#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); {5912#true} is VALID [2022-02-20 23:50:48,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,995 INFO L272 TraceCheckUtils]: 2: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} is VALID [2022-02-20 23:50:48,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} ~size := #in~size; {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} is VALID [2022-02-20 23:50:48,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} is VALID [2022-02-20 23:50:49,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} assume true; {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} is VALID [2022-02-20 23:50:49,001 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5924#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)) (_ bv0 32)) (= |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_BEFORE_CALL_5|) (_ bv0 32)))))} {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #99#return; {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {5946#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) |ULTIMATE.start_free_14_~plist#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) |ULTIMATE.start_free_14_~plist#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {5950#(and (= |ULTIMATE.start_free_14_#t~mem39#1.offset| (_ bv0 32)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= |ULTIMATE.start_free_14_#t~mem39#1.base| |ULTIMATE.start_free_14_~plist#1.base|))} is VALID [2022-02-20 23:50:49,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {5950#(and (= |ULTIMATE.start_free_14_#t~mem39#1.offset| (_ bv0 32)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= |ULTIMATE.start_free_14_#t~mem39#1.base| |ULTIMATE.start_free_14_~plist#1.base|))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:50:49,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:50:49,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:50:49,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {5954#(and (= |ULTIMATE.start_free_14_~plist#1.base| |ULTIMATE.start_free_14_~p~1#1.base|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|) (_ bv0 32)))} assume !!(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {5913#false} is VALID [2022-02-20 23:50:49,005 INFO L272 TraceCheckUtils]: 15: Hoare triple {5913#false} call ldv_list_del(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset)); {5913#false} is VALID [2022-02-20 23:50:49,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {5913#false} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {5913#false} is VALID [2022-02-20 23:50:49,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {5913#false} assume !(1bv1 == #valid[~entry#1.base]); {5913#false} is VALID [2022-02-20 23:50:49,005 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:50:49,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:49,006 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:49,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980719973] [2022-02-20 23:50:49,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980719973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:49,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:49,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:50:49,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984246363] [2022-02-20 23:50:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:49,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:49,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:49,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:49,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:49,032 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,876 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-20 23:50:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-20 23:50:49,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-02-20 23:50:49,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:49,974 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:50:49,975 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:50:49,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:49,975 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:49,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 304 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-02-20 23:50:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:50:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-02-20 23:50:49,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:49,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:49,978 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:49,978 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,980 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 23:50:49,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 85 states. [2022-02-20 23:50:49,981 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 85 states. [2022-02-20 23:50:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,986 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 23:50:49,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:49,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-02-20 23:50:49,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 18 [2022-02-20 23:50:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:49,989 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-02-20 23:50:49,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-02-20 23:50:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:49,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:49,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:50,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:50,204 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:50,204 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1052560596, now seen corresponding path program 1 times [2022-02-20 23:50:50,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:50,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8386999] [2022-02-20 23:50:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:50,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:50,207 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:50,208 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:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:50:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:50,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {6316#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); {6316#true} is VALID [2022-02-20 23:50:50,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {6316#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,447 INFO L272 TraceCheckUtils]: 2: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {6328#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:50,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {6328#(= |old(#valid)| |#valid|)} ~size := #in~size; {6328#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:50,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {6328#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {6328#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:50,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {6328#(= |old(#valid)| |#valid|)} assume true; {6328#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:50,449 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6328#(= |old(#valid)| |#valid|)} {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} #99#return; {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} assume !(alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32); {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} assume !(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} is VALID [2022-02-20 23:50:50,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {6324#(and (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~#list_14~0#1.base| v_ArrVal_114) |#valid|)))} assume { :end_inline_free_14 } true;call ULTIMATE.dealloc(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset);havoc entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset; {6368#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|) (_ bv0 1)) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:50:50,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|) (_ bv0 1)) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1)) |#valid|)))} assume { :end_inline_entry_point } true; {6368#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|) (_ bv0 1)) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:50:50,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {6368#(exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|) (_ bv0 1)) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1)) |#valid|)))} assume !(#valid == main_old_#valid#1); {6317#false} is VALID [2022-02-20 23:50:50,459 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:50:50,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:50,460 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:50,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8386999] [2022-02-20 23:50:50,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8386999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:50,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:50,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:50,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077353317] [2022-02-20 23:50:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:50,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:50,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:50,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:50,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:50,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:50,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:50,485 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,777 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-02-20 23:50:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:50,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:50:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:50:50,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-02-20 23:50:50,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:50,863 INFO L225 Difference]: With dead ends: 84 [2022-02-20 23:50:50,863 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 23:50:50,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:50,864 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:50,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-02-20 23:50:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 23:50:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-20 23:50:50,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:50,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:50,866 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:50,867 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,868 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-20 23:50:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:50:50,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 71 states. [2022-02-20 23:50:50,869 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 71 states. [2022-02-20 23:50:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,870 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-20 23:50:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:50:50,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:50,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-20 23:50:50,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 18 [2022-02-20 23:50:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:50,873 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-20 23:50:50,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:50:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:50,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:50,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:50,887 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:51,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:51,083 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash 874346275, now seen corresponding path program 1 times [2022-02-20 23:50:51,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:51,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493371600] [2022-02-20 23:50:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:51,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:51,085 INFO L229 MonitoredProcess]: Starting monitored process 18 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:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:50:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:51,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:50:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:51,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:51,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {6671#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); {6671#true} is VALID [2022-02-20 23:50:51,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {6671#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} is VALID [2022-02-20 23:50:51,317 INFO L272 TraceCheckUtils]: 2: Hoare triple {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {6671#true} is VALID [2022-02-20 23:50:51,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {6671#true} ~size := #in~size; {6671#true} is VALID [2022-02-20 23:50:51,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {6671#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; {6671#true} is VALID [2022-02-20 23:50:51,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {6671#true} assume true; {6671#true} is VALID [2022-02-20 23:50:51,318 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6671#true} {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} #99#return; {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} is VALID [2022-02-20 23:50:51,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} is VALID [2022-02-20 23:50:51,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} is VALID [2022-02-20 23:50:51,319 INFO L272 TraceCheckUtils]: 9: Hoare triple {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {6671#true} is VALID [2022-02-20 23:50:51,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {6671#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6707#(= |ldv_list_add_#in~head.base| ldv_list_add_~head.base)} is VALID [2022-02-20 23:50:51,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {6707#(= |ldv_list_add_#in~head.base| ldv_list_add_~head.base)} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:51,322 INFO L272 TraceCheckUtils]: 12: Hoare triple {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} assume true; {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 23:50:51,326 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6715#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_1|)))} {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} #97#return; {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:51,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} havoc #t~mem14.base, #t~mem14.offset; {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:51,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} assume true; {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:51,328 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6711#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))} {6679#(= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)} #101#return; {6746#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {6746#(= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {6750#(= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {6750#(= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_14_~plist#1.base]); {6672#false} is VALID [2022-02-20 23:50:51,329 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:50:51,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:51,329 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:51,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493371600] [2022-02-20 23:50:51,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493371600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:51,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:51,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:50:51,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992527635] [2022-02-20 23:50:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:51,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,365 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:51,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:51,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:51,366 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:51,732 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-20 23:50:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-02-20 23:50:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-02-20 23:50:51,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-02-20 23:50:51,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:51,809 INFO L225 Difference]: With dead ends: 71 [2022-02-20 23:50:51,810 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 23:50:51,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:51,810 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:51,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 171 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-02-20 23:50:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 23:50:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-20 23:50:51,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:51,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:51,813 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:51,813 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:51,815 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-20 23:50:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:50:51,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:51,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:51,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 71 states. [2022-02-20 23:50:51,816 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 71 states. [2022-02-20 23:50:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:51,817 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-20 23:50:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:50:51,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:51,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:51,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:51,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-02-20 23:50:51,819 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 25 [2022-02-20 23:50:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:51,820 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-02-20 23:50:51,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-20 23:50:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:51,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:51,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:51,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:52,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:52,030 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 874346276, now seen corresponding path program 1 times [2022-02-20 23:50:52,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:52,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196182521] [2022-02-20 23:50:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:52,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:52,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:52,032 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:52,034 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:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:52,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:50:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:52,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:52,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {7042#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); {7042#true} is VALID [2022-02-20 23:50:52,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {7042#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,356 INFO L272 TraceCheckUtils]: 2: Hoare triple {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {7042#true} is VALID [2022-02-20 23:50:52,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {7042#true} ~size := #in~size; {7042#true} is VALID [2022-02-20 23:50:52,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {7042#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; {7042#true} is VALID [2022-02-20 23:50:52,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {7042#true} assume true; {7042#true} is VALID [2022-02-20 23:50:52,357 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7042#true} {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #99#return; {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,358 INFO L272 TraceCheckUtils]: 9: Hoare triple {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {7042#true} is VALID [2022-02-20 23:50:52,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {7042#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {7078#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {7078#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:52,375 INFO L272 TraceCheckUtils]: 12: Hoare triple {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {7042#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {7042#true} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {7042#true} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {7042#true} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {7042#true} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {7042#true} is VALID [2022-02-20 23:50:52,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {7042#true} assume true; {7042#true} is VALID [2022-02-20 23:50:52,376 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7042#true} {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} #97#return; {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:52,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} havoc #t~mem14.base, #t~mem14.offset; {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:52,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} assume true; {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:52,378 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7082#(bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|))} {7050#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #101#return; {7116#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {7116#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {7120#(and (bvule (_ bv4 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {7120#(and (bvule (_ bv4 32) (select |#length| |ULTIMATE.start_free_14_~plist#1.base|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, free_14_~plist#1.offset), #length[free_14_~plist#1.base]) && ~bvule32(free_14_~plist#1.offset, ~bvadd32(4bv32, free_14_~plist#1.offset))) && ~bvule32(0bv32, free_14_~plist#1.offset)); {7043#false} is VALID [2022-02-20 23:50:52,381 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:50:52,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:52,381 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:52,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196182521] [2022-02-20 23:50:52,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196182521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:52,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:52,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:52,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333395070] [2022-02-20 23:50:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 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:52,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:52,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:52,424 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:52,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:52,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:52,425 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,246 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-20 23:50:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 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:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-02-20 23:50:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-02-20 23:50:53,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-02-20 23:50:53,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:53,362 INFO L225 Difference]: With dead ends: 69 [2022-02-20 23:50:53,362 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 23:50:53,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:53,363 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 64 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:53,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 23:50:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-20 23:50:53,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:53,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:53,365 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:53,365 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,366 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-20 23:50:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-20 23:50:53,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-02-20 23:50:53,367 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-02-20 23:50:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,369 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-20 23:50:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-20 23:50:53,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:53,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-02-20 23:50:53,371 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 25 [2022-02-20 23:50:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:53,371 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-02-20 23:50:53,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-20 23:50:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:53,372 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:53,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:53,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,582 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1566819771, now seen corresponding path program 1 times [2022-02-20 23:50:53,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:53,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125799050] [2022-02-20 23:50:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:53,584 INFO L229 MonitoredProcess]: Starting monitored process 20 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:53,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:50:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-20 23:50:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:53,737 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:54,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:54,073 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:54,313 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:54,317 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:54,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {7405#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); {7405#true} is VALID [2022-02-20 23:50:54,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {7413#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:54,450 INFO L272 TraceCheckUtils]: 2: Hoare triple {7413#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {7405#true} is VALID [2022-02-20 23:50:54,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {7405#true} ~size := #in~size; {7420#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:54,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {7420#(= 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; {7424#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:54,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {7424#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {7424#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:54,453 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7424#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {7413#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} #99#return; {7431#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:54,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {7431#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {7435#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:50:54,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {7435#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {7435#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:50:54,456 INFO L272 TraceCheckUtils]: 9: Hoare triple {7435#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {7442#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {7442#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {7446#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:54,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {7446#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {7446#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:54,464 INFO L272 TraceCheckUtils]: 12: Hoare triple {7446#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {7442#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {7442#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:54,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:54,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:54,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:54,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {7456#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {7469#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:54,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {7469#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:54,471 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7469#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {7446#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #97#return; {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:54,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:54,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:54,474 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7476#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {7435#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} #101#return; {7486#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (_ bv12 32)) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:50:54,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {7486#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (_ bv12 32)) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {7490#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {7490#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv12 32)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {7494#(and (= (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|))} is VALID [2022-02-20 23:50:54,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {7494#(and (= (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {7498#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:54,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {7498#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset)), #length[free_14_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_14_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_14_~p~1#1.offset))); {7406#false} is VALID [2022-02-20 23:50:54,477 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:50:54,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:54,478 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:54,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125799050] [2022-02-20 23:50:54,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125799050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:54,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:54,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:50:54,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978573144] [2022-02-20 23:50:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:54,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:54,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:54,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:54,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:50:54,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:50:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:50:54,517 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,123 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:50:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:55,123 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-02-20 23:50:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-02-20 23:50:55,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-02-20 23:50:55,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:55,197 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:50:55,197 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:50:55,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:50:55,198 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:55,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 248 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-02-20 23:50:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:50:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-02-20 23:50:55,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:55,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:55,200 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:55,200 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,202 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:50:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:50:55,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 72 states. [2022-02-20 23:50:55,203 INFO L87 Difference]: Start difference. First operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 72 states. [2022-02-20 23:50:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,204 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:50:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:50:55,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:55,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-02-20 23:50:55,206 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 27 [2022-02-20 23:50:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:55,206 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-02-20 23:50:55,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-02-20 23:50:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:55,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:55,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:55,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:55,417 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1566819772, now seen corresponding path program 1 times [2022-02-20 23:50:55,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:55,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531944504] [2022-02-20 23:50:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:55,420 INFO L229 MonitoredProcess]: Starting monitored process 21 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:55,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:50:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:55,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:50:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:55,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:55,537 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:55,794 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:55,956 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 20 treesize of output 12 [2022-02-20 23:50:56,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {7791#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); {7791#true} is VALID [2022-02-20 23:50:56,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {7791#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {7799#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:56,006 INFO L272 TraceCheckUtils]: 2: Hoare triple {7799#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {7791#true} is VALID [2022-02-20 23:50:56,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {7791#true} ~size := #in~size; {7791#true} is VALID [2022-02-20 23:50:56,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {7791#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; {7809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:56,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {7809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:56,008 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {7799#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} #99#return; {7816#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {7816#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {7820#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {7820#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {7820#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,010 INFO L272 TraceCheckUtils]: 9: Hoare triple {7820#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {7827#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {7827#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {7831#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {7831#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {7831#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,013 INFO L272 TraceCheckUtils]: 12: Hoare triple {7831#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {7827#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {7827#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {7841#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {7854#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:56,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {7854#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {7854#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:56,021 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7854#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {7831#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} #97#return; {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} havoc #t~mem14.base, #t~mem14.offset; {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} assume true; {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,023 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7861#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} {7820#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} #101#return; {7871#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))))} is VALID [2022-02-20 23:50:56,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {7871#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {7875#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:56,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {7875#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (_ bv1 1)) (_ bv0 1))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {7879#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:56,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {7879#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {7883#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:56,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {7883#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[free_14_~p~1#1.base]); {7792#false} is VALID [2022-02-20 23:50:56,025 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:50:56,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:56,025 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:56,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531944504] [2022-02-20 23:50:56,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531944504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:56,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:56,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:50:56,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067196876] [2022-02-20 23:50:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:56,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:56,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:56,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:50:56,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:50:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:56,060 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,697 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-02-20 23:50:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:50:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-02-20 23:50:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-02-20 23:50:56,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-02-20 23:50:56,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:56,794 INFO L225 Difference]: With dead ends: 68 [2022-02-20 23:50:56,794 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 23:50:56,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:50:56,795 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:56,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 223 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2022-02-20 23:50:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 23:50:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-02-20 23:50:56,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:56,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:56,797 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:56,797 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,800 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-02-20 23:50:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-02-20 23:50:56,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:56,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:56,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 68 states. [2022-02-20 23:50:56,801 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 68 states. [2022-02-20 23:50:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,803 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-02-20 23:50:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-02-20 23:50:56,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:56,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:56,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:56,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-20 23:50:56,806 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 27 [2022-02-20 23:50:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:56,807 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-20 23:50:56,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 23:50:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:56,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:56,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:56,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:57,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:57,010 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 204597629, now seen corresponding path program 1 times [2022-02-20 23:50:57,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:57,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334645235] [2022-02-20 23:50:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:57,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:57,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:57,012 INFO L229 MonitoredProcess]: Starting monitored process 22 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:57,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:50:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:50:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:57,165 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,405 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:57,587 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 20 treesize of output 12 [2022-02-20 23:50:57,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {8165#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); {8165#true} is VALID [2022-02-20 23:50:57,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {8165#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {8173#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:57,696 INFO L272 TraceCheckUtils]: 2: Hoare triple {8173#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {8165#true} is VALID [2022-02-20 23:50:57,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {8165#true} ~size := #in~size; {8165#true} is VALID [2022-02-20 23:50:57,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {8165#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; {8183#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:57,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {8183#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {8183#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:57,698 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8183#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {8173#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} #99#return; {8190#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {8190#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv1 1)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {8194#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {8194#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {8194#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,702 INFO L272 TraceCheckUtils]: 9: Hoare triple {8194#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {8201#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {8201#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {8205#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:57,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {8205#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {8205#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:57,704 INFO L272 TraceCheckUtils]: 12: Hoare triple {8205#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {8201#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {8201#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {8215#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {8228#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:57,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {8228#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {8228#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:57,709 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8228#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {8205#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} #97#return; {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} havoc #t~mem14.base, #t~mem14.offset; {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} assume true; {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:57,711 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8235#(and (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} {8194#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) (_ bv1 1)))} #101#return; {8245#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))))} is VALID [2022-02-20 23:50:57,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {8245#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {8249#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:57,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {8249#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (_ bv1 1)) (_ bv0 1))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {8253#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:57,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {8253#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} assume !!(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,714 INFO L272 TraceCheckUtils]: 29: Hoare triple {8257#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|)) (_ bv1 1)))} call ldv_list_del(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset)); {8270#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_#in~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {8270#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_#in~entry#1.base|)) (_ bv1 1)))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {8274#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {8274#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[~entry#1.base]); {8166#false} is VALID [2022-02-20 23:50:57,715 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:50:57,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:57,715 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:57,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334645235] [2022-02-20 23:50:57,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334645235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:57,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:57,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-20 23:50:57,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505102349] [2022-02-20 23:50:57,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:57,716 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:57,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:57,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:57,754 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:57,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:50:57,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:50:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:50:57,755 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,808 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-02-20 23:50:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:50:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 83 transitions. [2022-02-20 23:50:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 83 transitions. [2022-02-20 23:50:58,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 83 transitions. [2022-02-20 23:50:58,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:58,909 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:50:58,909 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:50:58,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:50:58,912 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:58,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 272 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2022-02-20 23:50:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:50:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2022-02-20 23:50:58,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:58,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:58,917 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:58,918 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,919 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-02-20 23:50:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:50:58,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:58,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:58,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 82 states. [2022-02-20 23:50:58,920 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 82 states. [2022-02-20 23:50:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,921 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-02-20 23:50:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:50:58,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:58,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:58,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:58,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-02-20 23:50:58,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 32 [2022-02-20 23:50:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:58,923 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-02-20 23:50:58,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-20 23:50:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:58,924 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:58,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:58,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:59,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:59,131 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:50:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 204597630, now seen corresponding path program 1 times [2022-02-20 23:50:59,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:59,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666356676] [2022-02-20 23:50:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:59,133 INFO L229 MonitoredProcess]: Starting monitored process 23 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:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:50:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:59,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-20 23:50:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:59,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:59,280 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:59,581 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:59,590 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:59,812 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:59,816 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:59,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {8606#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); {8606#true} is VALID [2022-02-20 23:50:59,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {8606#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {8614#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:50:59,995 INFO L272 TraceCheckUtils]: 2: Hoare triple {8614#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {8606#true} is VALID [2022-02-20 23:50:59,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {8606#true} ~size := #in~size; {8621#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:59,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {8621#(= 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; {8625#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:00,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {8625#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {8625#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:00,001 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8625#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {8614#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} #99#return; {8632#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} is VALID [2022-02-20 23:51:00,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {8632#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_alloc_14_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {8636#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:51:00,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {8636#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {8636#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:51:00,005 INFO L272 TraceCheckUtils]: 9: Hoare triple {8636#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {8643#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} is VALID [2022-02-20 23:51:00,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {8643#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {8647#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:00,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {8647#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {8647#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:00,011 INFO L272 TraceCheckUtils]: 12: Hoare triple {8647#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {8643#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} is VALID [2022-02-20 23:51:00,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {8643#(exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:00,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:00,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:00,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:00,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {8657#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {8670#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:00,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {8670#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {8670#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:00,017 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8670#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {8647#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #97#return; {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:00,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:00,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:00,019 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8677#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_14_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {8636#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} #101#return; {8687#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (_ bv12 32)) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:51:00,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {8687#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (_ bv12 32)) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {8691#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:51:00,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {8691#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv12 32)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {8695#(and (= (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|))} is VALID [2022-02-20 23:51:00,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {8695#(and (= (select |#length| |ULTIMATE.start_free_14_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:00,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:00,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:00,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} assume !!(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:00,022 INFO L272 TraceCheckUtils]: 29: Hoare triple {8699#(and (= (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} call ldv_list_del(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset)); {8712#(and (= (_ bv12 32) (select |#length| |ldv_list_del_#in~entry#1.base|)) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} is VALID [2022-02-20 23:51:00,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {8712#(and (= (_ bv12 32) (select |#length| |ldv_list_del_#in~entry#1.base|)) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {8716#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:51:00,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {8716#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~entry#1.offset)), #length[~entry#1.base]) && ~bvule32(~bvadd32(4bv32, ~entry#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~entry#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~entry#1.offset))); {8607#false} is VALID [2022-02-20 23:51:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:00,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:00,023 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:00,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666356676] [2022-02-20 23:51:00,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666356676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:00,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:00,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-20 23:51:00,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085323006] [2022-02-20 23:51:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:51:00,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:00,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:00,065 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:51:00,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:51:00,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:51:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:51:00,066 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,586 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:51:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:51:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:51:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 91 transitions. [2022-02-20 23:51:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 91 transitions. [2022-02-20 23:51:01,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 91 transitions. [2022-02-20 23:51:01,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:01,698 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:51:01,699 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:51:01,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:51:01,699 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:01,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 365 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 148 Unchecked, 0.5s Time] [2022-02-20 23:51:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:51:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-02-20 23:51:01,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:01,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:01,702 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:01,702 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,703 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:51:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-02-20 23:51:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:01,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 87 states. [2022-02-20 23:51:01,704 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 87 states. [2022-02-20 23:51:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,705 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:51:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-02-20 23:51:01,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:01,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:01,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:01,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-02-20 23:51:01,707 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 32 [2022-02-20 23:51:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:01,707 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-02-20 23:51:01,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 23:51:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:51:01,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:01,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:01,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:01,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:01,918 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:51:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 204495603, now seen corresponding path program 1 times [2022-02-20 23:51:01,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:01,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960089172] [2022-02-20 23:51:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:01,920 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:01,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-02-20 23:51:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:02,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:51:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:02,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:02,224 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:51:02,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:02,329 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-02-20 23:51:02,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {9067#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); {9067#true} is VALID [2022-02-20 23:51:02,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {9067#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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {9075#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,416 INFO L272 TraceCheckUtils]: 2: Hoare triple {9075#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {9067#true} is VALID [2022-02-20 23:51:02,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {9067#true} ~size := #in~size; {9067#true} is VALID [2022-02-20 23:51:02,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {9067#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; {9085#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:02,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {9085#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {9085#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:02,418 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9085#(= |ldv_malloc_#res.offset| (_ bv0 32))} {9075#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #99#return; {9092#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {9092#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {9096#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {9096#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {9096#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,418 INFO L272 TraceCheckUtils]: 9: Hoare triple {9096#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {9067#true} is VALID [2022-02-20 23:51:02,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {9067#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {9106#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:02,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {9106#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {9106#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:02,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {9106#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {9067#true} is VALID [2022-02-20 23:51:02,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {9067#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} is VALID [2022-02-20 23:51:02,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} is VALID [2022-02-20 23:51:02,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} is VALID [2022-02-20 23:51:02,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} is VALID [2022-02-20 23:51:02,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {9116#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {9129#(= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))} is VALID [2022-02-20 23:51:02,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {9129#(= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))} assume true; {9129#(= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))} is VALID [2022-02-20 23:51:02,428 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9129#(= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))} {9106#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #97#return; {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} is VALID [2022-02-20 23:51:02,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} havoc #t~mem14.base, #t~mem14.offset; {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} is VALID [2022-02-20 23:51:02,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} assume true; {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} is VALID [2022-02-20 23:51:02,430 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9136#(= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|)} {9096#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} #101#return; {9146#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {9146#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (_ bv0 32)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {9150#(and (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv4 32)))} is VALID [2022-02-20 23:51:02,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {9150#(and (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv0 32)) (_ bv4 32)))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {9154#(and (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {9154#(and (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:02,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {9158#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.offset| (_ bv0 32)))} assume !(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {9068#false} is VALID [2022-02-20 23:51:02,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {9068#false} assume { :end_inline_free_14 } true;call ULTIMATE.dealloc(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset);havoc entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset; {9068#false} is VALID [2022-02-20 23:51:02,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {9068#false} assume { :end_inline_entry_point } true; {9068#false} is VALID [2022-02-20 23:51:02,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {9068#false} assume !(#valid == main_old_#valid#1); {9068#false} is VALID [2022-02-20 23:51:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:02,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:02,440 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:02,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960089172] [2022-02-20 23:51:02,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960089172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:02,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:02,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:51:02,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70806757] [2022-02-20 23:51:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:51:02,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:02,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:02,486 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:51:02,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:51:02,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:51:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:51:02,486 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:04,223 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:51:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:51:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:51:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 23:51:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 23:51:04,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 70 transitions. [2022-02-20 23:51:04,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:04,315 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:51:04,315 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:51:04,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:51:04,316 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 42 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:04,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 471 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:51:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:51:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-02-20 23:51:04,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:04,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:04,318 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:04,319 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:04,320 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:51:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 23:51:04,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:04,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:04,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 77 states. [2022-02-20 23:51:04,321 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 77 states. [2022-02-20 23:51:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:04,322 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:51:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 23:51:04,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:04,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:04,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:04,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-02-20 23:51:04,324 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2022-02-20 23:51:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:04,324 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-02-20 23:51:04,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 23:51:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:51:04,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:04,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:04,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-02-20 23:51:04,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:04,531 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:51:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 609411339, now seen corresponding path program 1 times [2022-02-20 23:51:04,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:04,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541127891] [2022-02-20 23:51:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:04,533 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:04,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-02-20 23:51:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-20 23:51:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:04,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:04,789 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:51:04,790 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 21 [2022-02-20 23:51:04,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:04,850 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 15 treesize of output 19 [2022-02-20 23:51:05,026 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-02-20 23:51:05,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2022-02-20 23:51:05,476 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:51:05,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:05,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:51:05,603 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:51:05,635 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:51:05,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:51:06,044 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 27 treesize of output 19 [2022-02-20 23:51:06,197 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 30 treesize of output 18 [2022-02-20 23:51:06,825 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:51:06,825 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 31 treesize of output 14 [2022-02-20 23:51:06,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {9496#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); {9501#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {9501#(= (_ 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_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;call entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, 4bv32);call write~init~$Pointer$(entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset, entry_point_~#list_14~0#1.base, ~bvadd32(4bv32, entry_point_~#list_14~0#1.offset), 4bv32);assume { :begin_inline_alloc_14 } true;alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset, alloc_14_~list#1.base, alloc_14_~list#1.offset, alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset;alloc_14_~list#1.base, alloc_14_~list#1.offset := alloc_14_#in~list#1.base, alloc_14_#in~list#1.offset; {9505#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (or (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:51:06,921 INFO L272 TraceCheckUtils]: 2: Hoare triple {9505#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (or (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} call alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset := ldv_malloc(12bv32); {9509#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} is VALID [2022-02-20 23:51:06,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {9509#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} ~size := #in~size; {9509#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} is VALID [2022-02-20 23:51:06,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {9509#(and (= |old(#valid)| |#valid|) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} 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; {9516#(and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} is VALID [2022-02-20 23:51:06,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {9516#(and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} assume true; {9516#(and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} is VALID [2022-02-20 23:51:06,925 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9516#(and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (_ BitVec 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_21|))))} {9505#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (or (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} #99#return; {9523#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (not (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:51:06,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {9523#(and (= |ULTIMATE.start_alloc_14_#t~ret38#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (not (= |ULTIMATE.start_alloc_14_#t~ret38#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} alloc_14_~p~0#1.base, alloc_14_~p~0#1.offset := alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset;havoc alloc_14_#t~ret38#1.base, alloc_14_#t~ret38#1.offset; {9527#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:51:06,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {9527#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} assume alloc_14_~p~0#1.base != 0bv32 || alloc_14_~p~0#1.offset != 0bv32; {9527#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} is VALID [2022-02-20 23:51:06,927 INFO L272 TraceCheckUtils]: 9: Hoare triple {9527#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} call ldv_list_add(alloc_14_~p~0#1.base, ~bvadd32(4bv32, alloc_14_~p~0#1.offset), alloc_14_~list#1.base, alloc_14_~list#1.offset); {9534#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2022-02-20 23:51:06,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {9534#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {9538#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {9538#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {9542#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {9542#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {9546#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1)))} is VALID [2022-02-20 23:51:06,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {9546#(exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {9550#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {9550#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {9550#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {9550#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {9557#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {9557#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {9557#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {9557#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {9564#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:51:06,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {9564#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} assume true; {9564#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:51:06,939 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9564#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_8|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} {9542#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #97#return; {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,942 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9571#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {9527#(and (= |ULTIMATE.start_alloc_14_~list#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_alloc_14_~p~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start_alloc_14_~list#1.offset|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~p~0#1.base|)))} #101#return; {9581#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} is VALID [2022-02-20 23:51:06,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {9581#(and (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (_ bv1 1))) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)))} assume { :end_inline_alloc_14 } true;assume { :begin_inline_free_14 } true;free_14_#in~plist#1.base, free_14_#in~plist#1.offset := entry_point_~#list_14~0#1.base, entry_point_~#list_14~0#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset, free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset, free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset, free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset, free_14_#t~mem41#1.base, free_14_#t~mem41#1.offset, free_14_~__mptr~6#1.base, free_14_~__mptr~6#1.offset, free_14_~plist#1.base, free_14_~plist#1.offset, free_14_~p~1#1.base, free_14_~p~1#1.offset, free_14_~n~1#1.base, free_14_~n~1#1.offset;free_14_~plist#1.base, free_14_~plist#1.offset := free_14_#in~plist#1.base, free_14_#in~plist#1.offset;havoc free_14_~p~1#1.base, free_14_~p~1#1.offset;havoc free_14_~n~1#1.base, free_14_~n~1#1.offset; {9585#(and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))} is VALID [2022-02-20 23:51:06,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {9585#(and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))} SUMMARY for call free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset := read~$Pointer$(free_14_~plist#1.base, free_14_~plist#1.offset, 4bv32); srcloc: L770 {9589#(and (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|) (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) |ULTIMATE.start_free_14_#t~mem39#1.offset|)) (= |ULTIMATE.start_free_14_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)))))} is VALID [2022-02-20 23:51:06,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {9589#(and (= (_ bv4 32) |ULTIMATE.start_free_14_#t~mem39#1.offset|) (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) |ULTIMATE.start_free_14_#t~mem39#1.offset|)) (= |ULTIMATE.start_free_14_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)))))} free_14_~__mptr~4#1.base, free_14_~__mptr~4#1.offset := free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;havoc free_14_#t~mem39#1.base, free_14_#t~mem39#1.offset;free_14_~p~1#1.base, free_14_~p~1#1.offset := free_14_~__mptr~4#1.base, ~bvsub32(free_14_~__mptr~4#1.offset, 4bv32); {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} SUMMARY for call free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset := read~$Pointer$(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset), 4bv32); srcloc: L770-2 {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} free_14_~__mptr~5#1.base, free_14_~__mptr~5#1.offset := free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;havoc free_14_#t~mem40#1.base, free_14_#t~mem40#1.offset;free_14_~n~1#1.base, free_14_~n~1#1.offset := free_14_~__mptr~5#1.base, ~bvsub32(free_14_~__mptr~5#1.offset, 4bv32); {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} assume !!(free_14_~p~1#1.base != free_14_~plist#1.base || ~bvadd32(4bv32, free_14_~p~1#1.offset) != free_14_~plist#1.offset); {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,952 INFO L272 TraceCheckUtils]: 29: Hoare triple {9593#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|) |ULTIMATE.start_free_14_~p~1#1.base|))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_14_~p~1#1.offset|)))} call ldv_list_del(free_14_~p~1#1.base, ~bvadd32(4bv32, free_14_~p~1#1.offset)); {9606#(and (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|) (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)))))} is VALID [2022-02-20 23:51:06,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {9606#(and (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|) (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {9610#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:51:06,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {9610#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} SUMMARY for call #t~mem16#1.base, #t~mem16#1.offset := read~$Pointer$(~entry#1.base, ~bvadd32(4bv32, ~entry#1.offset), 4bv32); srcloc: L567 {9610#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:51:06,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {9610#(and (exists ((|ULTIMATE.start_free_14_~plist#1.offset| (_ BitVec 32)) (|ULTIMATE.start_free_14_~plist#1.base| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (= (bvadd (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (_ bv4 32))) (not (= |ULTIMATE.start_free_14_~plist#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} SUMMARY for call #t~mem17#1.base, #t~mem17#1.offset := read~$Pointer$(~entry#1.base, ~entry#1.offset, 4bv32); srcloc: L567-1 {9617#(= (_ bv0 1) (bvadd (select |#valid| |ldv_list_del_#t~mem17#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:06,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {9617#(= (_ bv0 1) (bvadd (select |#valid| |ldv_list_del_#t~mem17#1.base|) (_ bv1 1)))} assume { :begin_inline___ldv_list_del } true;__ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset, __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset := #t~mem16#1.base, #t~mem16#1.offset, #t~mem17#1.base, #t~mem17#1.offset;havoc __ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset;__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset := __ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset;__ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset := __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset; {9621#(= (_ bv0 1) (bvadd (select |#valid| |ldv_list_del___ldv_list_del_~next#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:06,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {9621#(= (_ bv0 1) (bvadd (select |#valid| |ldv_list_del___ldv_list_del_~next#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[__ldv_list_del_~next#1.base]); {9497#false} is VALID [2022-02-20 23:51:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:06,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:06,957 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:06,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541127891] [2022-02-20 23:51:06,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541127891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:06,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:06,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-20 23:51:06,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894210808] [2022-02-20 23:51:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:51:06,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:06,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:07,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:07,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:51:07,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:51:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:51:07,012 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,030 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:51:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 23:51:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:51:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 75 transitions. [2022-02-20 23:51:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 75 transitions. [2022-02-20 23:51:09,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 75 transitions. [2022-02-20 23:51:09,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:09,142 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:51:09,142 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:51:09,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 23:51:09,143 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:09,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 447 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 283 Unchecked, 0.5s Time] [2022-02-20 23:51:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:51:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2022-02-20 23:51:09,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:09,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:09,145 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:09,146 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,147 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:51:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:51:09,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 78 states. [2022-02-20 23:51:09,147 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 78 states. [2022-02-20 23:51:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,149 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:51:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:51:09,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:09,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:51:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-02-20 23:51:09,151 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 35 [2022-02-20 23:51:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:09,151 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-02-20 23:51:09,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-20 23:51:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:51:09,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:09,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:09,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:09,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:09,362 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_list_delErr5REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:51:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 609411340, now seen corresponding path program 1 times [2022-02-20 23:51:09,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:09,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138094212] [2022-02-20 23:51:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:09,364 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-02-20 23:51:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:09,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 90 conjunts are in the unsatisfiable core [2022-02-20 23:51:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:09,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:09,549 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:51:09,559 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:51:09,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:51:09,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:51:09,760 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:51:09,760 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 18 [2022-02-20 23:51:09,783 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:09,783 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 11 treesize of output 11 [2022-02-20 23:51:10,025 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 7 treesize of output 3 [2022-02-20 23:51:10,030 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 7 treesize of output 3 [2022-02-20 23:51:10,399 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:51:10,414 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:51:10,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:10,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:51:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:10,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:51:10,590 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:51:10,590 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:51:10,636 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:51:10,636 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:51:11,020 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 27 treesize of output 19 [2022-02-20 23:51:11,030 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 27 treesize of output 19