./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3c246dc22ee025e6722717057cde618bbb130ed ............................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3c246dc22ee025e6722717057cde618bbb130ed ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:05:51,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:05:51,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:05:51,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:05:51,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:05:51,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:05:51,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:05:51,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:05:51,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:05:51,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:05:51,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:05:51,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:05:51,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:05:51,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:05:51,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:05:51,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:05:51,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:05:51,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:05:51,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:05:52,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:05:52,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:05:52,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:05:52,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:05:52,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:05:52,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:05:52,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:05:52,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:05:52,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:05:52,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:05:52,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:05:52,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:05:52,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:05:52,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:05:52,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:05:52,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:05:52,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:05:52,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:05:52,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:05:52,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:05:52,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:05:52,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:05:52,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:05:52,042 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:05:52,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:05:52,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:05:52,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:05:52,047 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:05:52,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:05:52,047 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:05:52,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:05:52,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:05:52,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:05:52,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:05:52,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:05:52,050 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:05:52,050 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:05:52,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:05:52,051 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:05:52,051 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:05:52,051 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:05:52,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:05:52,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:05:52,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:05:52,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:05:52,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:52,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:05:52,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:05:52,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:05:52,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:05:52,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:05:52,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> a3c246dc22ee025e6722717057cde618bbb130ed [2020-07-29 01:05:52,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:05:52,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:05:52,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:05:52,374 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:05:52,374 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:05:52,375 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2020-07-29 01:05:52,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e707671/ed420926774a413f8a7cba1f9e4cf630/FLAG7515bbd5a [2020-07-29 01:05:53,004 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:05:53,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2020-07-29 01:05:53,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e707671/ed420926774a413f8a7cba1f9e4cf630/FLAG7515bbd5a [2020-07-29 01:05:53,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e707671/ed420926774a413f8a7cba1f9e4cf630 [2020-07-29 01:05:53,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:05:53,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:05:53,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:53,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:05:53,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:05:53,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405764bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53, skipping insertion in model container [2020-07-29 01:05:53,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:05:53,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:53,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:53,849 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) [2020-07-29 01:05:53,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f82202e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53, skipping insertion in model container [2020-07-29 01:05:53,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:53,851 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-07-29 01:05:53,856 INFO L168 Benchmark]: Toolchain (without parser) took 618.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:05:53,857 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:05:53,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:05:53,864 INFO L336 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * 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... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:05:55,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:05:55,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:05:55,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:05:55,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:05:55,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:05:55,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:05:55,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:05:55,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:05:55,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:05:55,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:05:55,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:05:55,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:05:55,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:05:55,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:05:55,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:05:55,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:05:55,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:05:55,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:05:55,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:05:55,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:05:55,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:05:55,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:05:55,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:05:55,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:05:55,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:05:55,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:05:55,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:05:55,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:05:55,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:05:55,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:05:55,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:05:55,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:05:55,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:05:55,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:05:55,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:05:55,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:05:55,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:05:55,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:05:55,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:05:55,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:05:55,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:05:55,902 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:05:55,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:05:55,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:05:55,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:05:55,904 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:05:55,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:05:55,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:05:55,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:05:55,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:05:55,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:05:55,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:05:55,906 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:05:55,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:05:55,906 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:05:55,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:05:55,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:05:55,907 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:05:55,908 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:05:55,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:05:55,908 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:05:55,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:05:55,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:05:55,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:05:55,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:05:55,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:55,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:05:55,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:05:55,910 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:05:55,911 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:05:55,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:05:55,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:05:55,912 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a3c246dc22ee025e6722717057cde618bbb130ed [2020-07-29 01:05:56,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:05:56,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:05:56,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:05:56,251 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:05:56,252 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:05:56,252 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2020-07-29 01:05:56,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3428336/a1c686d4fd8c499dbdf40d956d83a622/FLAG32b8f8131 [2020-07-29 01:05:56,839 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:05:56,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2020-07-29 01:05:56,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3428336/a1c686d4fd8c499dbdf40d956d83a622/FLAG32b8f8131 [2020-07-29 01:05:57,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3428336/a1c686d4fd8c499dbdf40d956d83a622 [2020-07-29 01:05:57,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:05:57,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:05:57,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:57,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:05:57,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:05:57,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:57" (1/1) ... [2020-07-29 01:05:57,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3855d1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:57, skipping insertion in model container [2020-07-29 01:05:57,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:57" (1/1) ... [2020-07-29 01:05:57,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:05:57,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:57,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:57,777 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-07-29 01:05:57,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:57,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:57,854 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:05:57,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:58,053 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:05:58,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58 WrapperNode [2020-07-29 01:05:58,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:58,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:05:58,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:05:58,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:05:58,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... [2020-07-29 01:05:58,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:05:58,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:05:58,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:05:58,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:05:58,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:05:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:05:58,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:05:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:05:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:05:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:05:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:05:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:05:58,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:05:58,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-07-29 01:05:58,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-07-29 01:05:58,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-07-29 01:05:58,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-07-29 01:05:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:05:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-07-29 01:05:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-07-29 01:05:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-07-29 01:05:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-07-29 01:05:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-07-29 01:05:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-07-29 01:05:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-07-29 01:05:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-07-29 01:05:58,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-07-29 01:05:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-07-29 01:05:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-07-29 01:05:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-07-29 01:05:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-07-29 01:05:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-29 01:05:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-29 01:05:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure h5 [2020-07-29 01:05:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure g5 [2020-07-29 01:05:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-07-29 01:05:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:05:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-07-29 01:05:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-29 01:05:58,264 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-07-29 01:05:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:05:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:05:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:05:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:05:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:05:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:05:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:05:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:05:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:05:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:05:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:05:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:05:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:05:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:05:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:05:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:05:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:05:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:05:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:05:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:05:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:05:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:05:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:05:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:05:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:05:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:05:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:05:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:05:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:05:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:05:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:05:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:05:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:05:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:05:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:05:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:05:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:05:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:05:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:05:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:05:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:05:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:05:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:05:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:05:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:05:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:05:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:05:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:05:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:05:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:05:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:05:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:05:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:05:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:05:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:05:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:05:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:05:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:05:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:05:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:05:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:05:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:05:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:05:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:05:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:05:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:05:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:05:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:05:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:05:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:05:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:05:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:05:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:05:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:05:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-07-29 01:05:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-07-29 01:05:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-29 01:05:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:05:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-07-29 01:05:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:05:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-07-29 01:05:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-29 01:05:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:05:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:05:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-07-29 01:05:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-07-29 01:05:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-07-29 01:05:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:05:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-07-29 01:05:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-07-29 01:05:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-07-29 01:05:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-07-29 01:05:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-07-29 01:05:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-07-29 01:05:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-07-29 01:05:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:05:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:05:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-07-29 01:05:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-07-29 01:05:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:05:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-07-29 01:05:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-07-29 01:05:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-07-29 01:05:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-07-29 01:05:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-07-29 01:05:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-07-29 01:05:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-07-29 01:05:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-29 01:05:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-29 01:05:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure h5 [2020-07-29 01:05:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure g5 [2020-07-29 01:05:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-07-29 01:05:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:05:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:05:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:05:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 01:05:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:05:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:05:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-07-29 01:05:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-07-29 01:05:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-07-29 01:05:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-07-29 01:05:58,989 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:05:59,472 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:05:59,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:05:59,998 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:06:00,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:00 BoogieIcfgContainer [2020-07-29 01:06:00,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:06:00,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:06:00,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:06:00,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:06:00,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:05:57" (1/3) ... [2020-07-29 01:06:00,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5eb957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:00, skipping insertion in model container [2020-07-29 01:06:00,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:58" (2/3) ... [2020-07-29 01:06:00,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5eb957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:00, skipping insertion in model container [2020-07-29 01:06:00,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:00" (3/3) ... [2020-07-29 01:06:00,015 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test5.i [2020-07-29 01:06:00,027 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:06:00,036 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2020-07-29 01:06:00,055 INFO L251 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2020-07-29 01:06:00,080 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:06:00,081 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:06:00,081 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:06:00,081 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:06:00,081 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:06:00,082 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:06:00,082 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:06:00,082 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:06:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2020-07-29 01:06:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:06:00,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:00,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:00,126 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:00,136 INFO L82 PathProgramCache]: Analyzing trace with hash -797462538, now seen corresponding path program 1 times [2020-07-29 01:06:00,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:00,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664105443] [2020-07-29 01:06:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:06:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:00,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:00,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2020-07-29 01:06:00,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {107#true} is VALID [2020-07-29 01:06:00,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2020-07-29 01:06:00,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #458#return; {107#true} is VALID [2020-07-29 01:06:00,524 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call main(); {107#true} is VALID [2020-07-29 01:06:00,524 INFO L263 TraceCheckUtils]: 5: Hoare triple {107#true} call entry_point(); {107#true} is VALID [2020-07-29 01:06:00,524 INFO L263 TraceCheckUtils]: 6: Hoare triple {107#true} call #t~ret39.base, #t~ret39.offset := h5(); {107#true} is VALID [2020-07-29 01:06:00,525 INFO L263 TraceCheckUtils]: 7: Hoare triple {107#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {107#true} is VALID [2020-07-29 01:06:00,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {107#true} ~size := #in~size; {107#true} is VALID [2020-07-29 01:06:00,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {107#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; {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:00,535 INFO L280 TraceCheckUtils]: 10: Hoare triple {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:00,537 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {107#true} #442#return; {146#(= (_ bv0 32) |h5_#t~ret38.offset|)} is VALID [2020-07-29 01:06:00,539 INFO L280 TraceCheckUtils]: 12: Hoare triple {146#(= (_ bv0 32) |h5_#t~ret38.offset|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {150#(= (_ bv0 32) |h5_#res.offset|)} is VALID [2020-07-29 01:06:00,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#(= (_ bv0 32) |h5_#res.offset|)} assume true; {150#(= (_ bv0 32) |h5_#res.offset|)} is VALID [2020-07-29 01:06:00,541 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {150#(= (_ bv0 32) |h5_#res.offset|)} {107#true} #446#return; {157#(= |entry_point_#t~ret39.offset| (_ bv0 32))} is VALID [2020-07-29 01:06:00,543 INFO L280 TraceCheckUtils]: 15: Hoare triple {157#(= |entry_point_#t~ret39.offset| (_ bv0 32))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {161#(= entry_point_~p~1.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,545 INFO L263 TraceCheckUtils]: 16: Hoare triple {161#(= entry_point_~p~1.offset (_ bv0 32))} call g5(~p~1.base, ~p~1.offset); {165#(= |g5_#in~p.offset| (_ bv0 32))} is VALID [2020-07-29 01:06:00,548 INFO L280 TraceCheckUtils]: 17: Hoare triple {165#(= |g5_#in~p.offset| (_ bv0 32))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {169#(= g5_~p.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,550 INFO L280 TraceCheckUtils]: 18: Hoare triple {169#(= g5_~p.offset (_ bv0 32))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {169#(= g5_~p.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {169#(= g5_~p.offset (_ bv0 32))} assume !(0bv32 == ~p.offset); {108#false} is VALID [2020-07-29 01:06:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:00,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:00,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {169#(= g5_~p.offset (_ bv0 32))} assume !(0bv32 == ~p.offset); {108#false} is VALID [2020-07-29 01:06:00,746 INFO L280 TraceCheckUtils]: 18: Hoare triple {169#(= g5_~p.offset (_ bv0 32))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {169#(= g5_~p.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,747 INFO L280 TraceCheckUtils]: 17: Hoare triple {165#(= |g5_#in~p.offset| (_ bv0 32))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {169#(= g5_~p.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,753 INFO L263 TraceCheckUtils]: 16: Hoare triple {161#(= entry_point_~p~1.offset (_ bv0 32))} call g5(~p~1.base, ~p~1.offset); {165#(= |g5_#in~p.offset| (_ bv0 32))} is VALID [2020-07-29 01:06:00,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {157#(= |entry_point_#t~ret39.offset| (_ bv0 32))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {161#(= entry_point_~p~1.offset (_ bv0 32))} is VALID [2020-07-29 01:06:00,755 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {150#(= (_ bv0 32) |h5_#res.offset|)} {107#true} #446#return; {157#(= |entry_point_#t~ret39.offset| (_ bv0 32))} is VALID [2020-07-29 01:06:00,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#(= (_ bv0 32) |h5_#res.offset|)} assume true; {150#(= (_ bv0 32) |h5_#res.offset|)} is VALID [2020-07-29 01:06:00,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {146#(= (_ bv0 32) |h5_#t~ret38.offset|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {150#(= (_ bv0 32) |h5_#res.offset|)} is VALID [2020-07-29 01:06:00,760 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {107#true} #442#return; {146#(= (_ bv0 32) |h5_#t~ret38.offset|)} is VALID [2020-07-29 01:06:00,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:00,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {107#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; {139#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:00,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {107#true} ~size := #in~size; {107#true} is VALID [2020-07-29 01:06:00,763 INFO L263 TraceCheckUtils]: 7: Hoare triple {107#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {107#true} is VALID [2020-07-29 01:06:00,764 INFO L263 TraceCheckUtils]: 6: Hoare triple {107#true} call #t~ret39.base, #t~ret39.offset := h5(); {107#true} is VALID [2020-07-29 01:06:00,764 INFO L263 TraceCheckUtils]: 5: Hoare triple {107#true} call entry_point(); {107#true} is VALID [2020-07-29 01:06:00,764 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call main(); {107#true} is VALID [2020-07-29 01:06:00,764 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #458#return; {107#true} is VALID [2020-07-29 01:06:00,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2020-07-29 01:06:00,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {107#true} is VALID [2020-07-29 01:06:00,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2020-07-29 01:06:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:00,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664105443] [2020-07-29 01:06:00,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:00,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2020-07-29 01:06:00,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769751941] [2020-07-29 01:06:00,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:06:00,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:00,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:06:00,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:00,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:06:00,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:06:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:06:00,836 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 9 states. [2020-07-29 01:06:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,268 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-29 01:06:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:06:01,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:06:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-29 01:06:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-29 01:06:01,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-29 01:06:01,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:01,359 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:06:01,360 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:06:01,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:06:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:06:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-29 01:06:01,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:01,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-29 01:06:01,394 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:06:01,394 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:06:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,399 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:06:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:06:01,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:01,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:01,400 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:06:01,400 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:06:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,405 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:06:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:06:01,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:01,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:01,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:01,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:06:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-29 01:06:01,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2020-07-29 01:06:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:01,412 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-29 01:06:01,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:06:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:06:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:06:01,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:01,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:01,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:06:01,628 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1048465454, now seen corresponding path program 1 times [2020-07-29 01:06:01,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:01,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101306578] [2020-07-29 01:06:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:01,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:06:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:01,979 INFO L263 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2020-07-29 01:06:01,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume true; {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,981 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} {360#true} #458#return; {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,982 INFO L263 TraceCheckUtils]: 4: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} call main(); {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,982 INFO L263 TraceCheckUtils]: 5: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point(); {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,983 INFO L263 TraceCheckUtils]: 6: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} call #t~ret39.base, #t~ret39.offset := h5(); {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,984 INFO L263 TraceCheckUtils]: 7: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:01,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {393#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:01,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {393#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} assume true; {393#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:01,997 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {393#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} #442#return; {400#(and (bvult |h5_#t~ret38.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |h5_#t~ret38.base|)))} is VALID [2020-07-29 01:06:01,998 INFO L280 TraceCheckUtils]: 12: Hoare triple {400#(and (bvult |h5_#t~ret38.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |h5_#t~ret38.base|)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {404#(and (not (= (_ bv0 32) |h5_#res.base|)) (bvult |h5_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:01,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#(and (not (= (_ bv0 32) |h5_#res.base|)) (bvult |h5_#res.base| |#StackHeapBarrier|))} assume true; {404#(and (not (= (_ bv0 32) |h5_#res.base|)) (bvult |h5_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:01,999 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {404#(and (not (= (_ bv0 32) |h5_#res.base|)) (bvult |h5_#res.base| |#StackHeapBarrier|))} {368#(bvult (_ bv0 32) |#StackHeapBarrier|)} #446#return; {411#(and (not (= |entry_point_#t~ret39.base| (_ bv0 32))) (bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:02,001 INFO L280 TraceCheckUtils]: 15: Hoare triple {411#(and (not (= |entry_point_#t~ret39.base| (_ bv0 32))) (bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {415#(and (not (= entry_point_~p~1.base (_ bv0 32))) (bvult entry_point_~p~1.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:02,002 INFO L263 TraceCheckUtils]: 16: Hoare triple {415#(and (not (= entry_point_~p~1.base (_ bv0 32))) (bvult entry_point_~p~1.base |#StackHeapBarrier|))} call g5(~p~1.base, ~p~1.offset); {419#(and (bvult |g5_#in~p.base| |#StackHeapBarrier|) (not (= |g5_#in~p.base| (_ bv0 32))))} is VALID [2020-07-29 01:06:02,002 INFO L280 TraceCheckUtils]: 17: Hoare triple {419#(and (bvult |g5_#in~p.base| |#StackHeapBarrier|) (not (= |g5_#in~p.base| (_ bv0 32))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} is VALID [2020-07-29 01:06:02,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} is VALID [2020-07-29 01:06:02,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} assume 0bv32 == ~p.offset; {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} is VALID [2020-07-29 01:06:02,007 INFO L280 TraceCheckUtils]: 20: Hoare triple {423#(and (bvult g5_~p.base |#StackHeapBarrier|) (not (= g5_~p.base (_ bv0 32))))} assume !~bvult32(~p.base, #StackHeapBarrier); {361#false} is VALID [2020-07-29 01:06:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:02,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:02,542 INFO L280 TraceCheckUtils]: 20: Hoare triple {433#(bvult g5_~p.base |#StackHeapBarrier|)} assume !~bvult32(~p.base, #StackHeapBarrier); {361#false} is VALID [2020-07-29 01:06:02,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {433#(bvult g5_~p.base |#StackHeapBarrier|)} assume 0bv32 == ~p.offset; {433#(bvult g5_~p.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,544 INFO L280 TraceCheckUtils]: 18: Hoare triple {433#(bvult g5_~p.base |#StackHeapBarrier|)} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {433#(bvult g5_~p.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,544 INFO L280 TraceCheckUtils]: 17: Hoare triple {443#(bvult |g5_#in~p.base| |#StackHeapBarrier|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {433#(bvult g5_~p.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,548 INFO L263 TraceCheckUtils]: 16: Hoare triple {447#(bvult entry_point_~p~1.base |#StackHeapBarrier|)} call g5(~p~1.base, ~p~1.offset); {443#(bvult |g5_#in~p.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {451#(bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|)} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {447#(bvult entry_point_~p~1.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,549 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {458#(bvult |h5_#res.base| |#StackHeapBarrier|)} {360#true} #446#return; {451#(bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {458#(bvult |h5_#res.base| |#StackHeapBarrier|)} assume true; {458#(bvult |h5_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {465#(bvult |h5_#t~ret38.base| |#StackHeapBarrier|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {458#(bvult |h5_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,552 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {472#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {360#true} #442#return; {465#(bvult |h5_#t~ret38.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {472#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#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; {472#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:02,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#true} ~size := #in~size; {360#true} is VALID [2020-07-29 01:06:02,554 INFO L263 TraceCheckUtils]: 7: Hoare triple {360#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {360#true} is VALID [2020-07-29 01:06:02,554 INFO L263 TraceCheckUtils]: 6: Hoare triple {360#true} call #t~ret39.base, #t~ret39.offset := h5(); {360#true} is VALID [2020-07-29 01:06:02,554 INFO L263 TraceCheckUtils]: 5: Hoare triple {360#true} call entry_point(); {360#true} is VALID [2020-07-29 01:06:02,555 INFO L263 TraceCheckUtils]: 4: Hoare triple {360#true} call main(); {360#true} is VALID [2020-07-29 01:06:02,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #458#return; {360#true} is VALID [2020-07-29 01:06:02,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-29 01:06:02,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {360#true} is VALID [2020-07-29 01:06:02,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2020-07-29 01:06:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:02,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101306578] [2020-07-29 01:06:02,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:02,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2020-07-29 01:06:02,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933337985] [2020-07-29 01:06:02,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-07-29 01:06:02,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:02,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 01:06:02,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:02,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-29 01:06:02,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 01:06:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:06:02,625 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2020-07-29 01:06:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:04,119 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:06:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-29 01:06:04,120 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-07-29 01:06:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:06:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2020-07-29 01:06:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:06:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2020-07-29 01:06:04,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 50 transitions. [2020-07-29 01:06:04,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:04,210 INFO L225 Difference]: With dead ends: 46 [2020-07-29 01:06:04,211 INFO L226 Difference]: Without dead ends: 46 [2020-07-29 01:06:04,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-07-29 01:06:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-29 01:06:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2020-07-29 01:06:04,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:04,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2020-07-29 01:06:04,218 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2020-07-29 01:06:04,218 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2020-07-29 01:06:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:04,222 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:06:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:06:04,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:04,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:04,223 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2020-07-29 01:06:04,223 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2020-07-29 01:06:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:04,227 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:06:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:06:04,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:04,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:04,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:04,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:06:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-07-29 01:06:04,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 21 [2020-07-29 01:06:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:04,232 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-07-29 01:06:04,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-29 01:06:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-29 01:06:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:06:04,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:04,234 INFO L422 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] [2020-07-29 01:06:04,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:06:04,456 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1857308936, now seen corresponding path program 1 times [2020-07-29 01:06:04,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:04,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662631629] [2020-07-29 01:06:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:04,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:06:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:04,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:04,676 INFO L384 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 [2020-07-29 01:06:04,677 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:06:04,681 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:06:04,682 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:06:04,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:06:04,690 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:06:04,690 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_144|]. (= |#valid| (store |v_#valid_144| |ldv_malloc_#res.base| (_ bv1 1))) [2020-07-29 01:06:04,691 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) [2020-07-29 01:06:04,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2020-07-29 01:06:04,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {689#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {689#true} is VALID [2020-07-29 01:06:04,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2020-07-29 01:06:04,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #458#return; {689#true} is VALID [2020-07-29 01:06:04,808 INFO L263 TraceCheckUtils]: 4: Hoare triple {689#true} call main(); {689#true} is VALID [2020-07-29 01:06:04,809 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#true} call entry_point(); {689#true} is VALID [2020-07-29 01:06:04,809 INFO L263 TraceCheckUtils]: 6: Hoare triple {689#true} call #t~ret39.base, #t~ret39.offset := h5(); {689#true} is VALID [2020-07-29 01:06:04,809 INFO L263 TraceCheckUtils]: 7: Hoare triple {689#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {689#true} is VALID [2020-07-29 01:06:04,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {689#true} ~size := #in~size; {689#true} is VALID [2020-07-29 01:06:04,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {689#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; {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,814 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {689#true} #442#return; {728#(= (_ bv1 1) (select |#valid| |h5_#t~ret38.base|))} is VALID [2020-07-29 01:06:04,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {728#(= (_ bv1 1) (select |#valid| |h5_#t~ret38.base|))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,817 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} {689#true} #446#return; {739#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,818 INFO L280 TraceCheckUtils]: 15: Hoare triple {739#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {743#(= (bvadd (select |#valid| entry_point_~p~1.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,819 INFO L263 TraceCheckUtils]: 16: Hoare triple {743#(= (bvadd (select |#valid| entry_point_~p~1.base) (_ bv1 1)) (_ bv0 1))} call g5(~p~1.base, ~p~1.offset); {747#(= (_ bv1 1) (select |#valid| |g5_#in~p.base|))} is VALID [2020-07-29 01:06:04,820 INFO L280 TraceCheckUtils]: 17: Hoare triple {747#(= (_ bv1 1) (select |#valid| |g5_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume 0bv32 == ~p.offset; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume ~bvult32(~p.base, #StackHeapBarrier); {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:04,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~p.base || 1bv1 == #valid[~p.base]); {690#false} is VALID [2020-07-29 01:06:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:04,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:05,040 INFO L280 TraceCheckUtils]: 21: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~p.base || 1bv1 == #valid[~p.base]); {690#false} is VALID [2020-07-29 01:06:05,041 INFO L280 TraceCheckUtils]: 20: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume ~bvult32(~p.base, #StackHeapBarrier); {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume 0bv32 == ~p.offset; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,049 INFO L280 TraceCheckUtils]: 18: Hoare triple {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {747#(= (_ bv1 1) (select |#valid| |g5_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {751#(= (bvadd (select |#valid| g5_~p.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,052 INFO L263 TraceCheckUtils]: 16: Hoare triple {743#(= (bvadd (select |#valid| entry_point_~p~1.base) (_ bv1 1)) (_ bv0 1))} call g5(~p~1.base, ~p~1.offset); {747#(= (_ bv1 1) (select |#valid| |g5_#in~p.base|))} is VALID [2020-07-29 01:06:05,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {739#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {743#(= (bvadd (select |#valid| entry_point_~p~1.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,053 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} {689#true} #446#return; {739#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,054 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {728#(= (_ bv1 1) (select |#valid| |h5_#t~ret38.base|))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {732#(= (bvadd (select |#valid| |h5_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,056 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {689#true} #442#return; {728#(= (_ bv1 1) (select |#valid| |h5_#t~ret38.base|))} is VALID [2020-07-29 01:06:05,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,058 INFO L280 TraceCheckUtils]: 9: Hoare triple {689#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; {721#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:05,059 INFO L280 TraceCheckUtils]: 8: Hoare triple {689#true} ~size := #in~size; {689#true} is VALID [2020-07-29 01:06:05,059 INFO L263 TraceCheckUtils]: 7: Hoare triple {689#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {689#true} is VALID [2020-07-29 01:06:05,059 INFO L263 TraceCheckUtils]: 6: Hoare triple {689#true} call #t~ret39.base, #t~ret39.offset := h5(); {689#true} is VALID [2020-07-29 01:06:05,059 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#true} call entry_point(); {689#true} is VALID [2020-07-29 01:06:05,060 INFO L263 TraceCheckUtils]: 4: Hoare triple {689#true} call main(); {689#true} is VALID [2020-07-29 01:06:05,060 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #458#return; {689#true} is VALID [2020-07-29 01:06:05,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2020-07-29 01:06:05,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {689#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {689#true} is VALID [2020-07-29 01:06:05,061 INFO L263 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2020-07-29 01:06:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:05,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662631629] [2020-07-29 01:06:05,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:05,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2020-07-29 01:06:05,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095677630] [2020-07-29 01:06:05,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-29 01:06:05,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:05,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:06:05,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:05,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:06:05,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:06:05,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:06:05,118 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2020-07-29 01:06:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:05,586 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-29 01:06:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:06:05,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-29 01:06:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-29 01:06:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-29 01:06:05,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-29 01:06:05,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:05,656 INFO L225 Difference]: With dead ends: 43 [2020-07-29 01:06:05,656 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:06:05,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:06:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:06:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-29 01:06:05,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:05,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-29 01:06:05,669 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:06:05,669 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:06:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:05,673 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-29 01:06:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:06:05,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:05,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:05,674 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:06:05,674 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:06:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:05,677 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-29 01:06:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:06:05,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:05,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:05,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:06:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-29 01:06:05,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 22 [2020-07-29 01:06:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:05,681 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-29 01:06:05,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:06:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:06:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:06:05,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:05,683 INFO L422 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] [2020-07-29 01:06:05,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:06:05,891 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2144255353, now seen corresponding path program 1 times [2020-07-29 01:06:05,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:05,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700318531] [2020-07-29 01:06:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:06,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:06:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:06,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:06,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2020-07-29 01:06:06,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1003#true} is VALID [2020-07-29 01:06:06,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2020-07-29 01:06:06,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #458#return; {1003#true} is VALID [2020-07-29 01:06:06,205 INFO L263 TraceCheckUtils]: 4: Hoare triple {1003#true} call main(); {1003#true} is VALID [2020-07-29 01:06:06,205 INFO L263 TraceCheckUtils]: 5: Hoare triple {1003#true} call entry_point(); {1003#true} is VALID [2020-07-29 01:06:06,205 INFO L263 TraceCheckUtils]: 6: Hoare triple {1003#true} call #t~ret39.base, #t~ret39.offset := h5(); {1003#true} is VALID [2020-07-29 01:06:06,205 INFO L263 TraceCheckUtils]: 7: Hoare triple {1003#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1003#true} is VALID [2020-07-29 01:06:06,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {1003#true} ~size := #in~size; {1003#true} is VALID [2020-07-29 01:06:06,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {1003#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,212 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1003#true} #442#return; {1042#(and (= (_ bv0 32) |h5_#t~ret38.offset|) (= (_ bv0 32) |h5_#t~ret38.base|))} is VALID [2020-07-29 01:06:06,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {1042#(and (= (_ bv0 32) |h5_#t~ret38.offset|) (= (_ bv0 32) |h5_#t~ret38.base|))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} is VALID [2020-07-29 01:06:06,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} assume true; {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} is VALID [2020-07-29 01:06:06,214 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} {1003#true} #446#return; {1053#(and (= |entry_point_#t~ret39.offset| (_ bv0 32)) (= |entry_point_#t~ret39.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,215 INFO L280 TraceCheckUtils]: 15: Hoare triple {1053#(and (= |entry_point_#t~ret39.offset| (_ bv0 32)) (= |entry_point_#t~ret39.base| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1057#(and (= entry_point_~p~1.base (_ bv0 32)) (= entry_point_~p~1.offset (_ bv0 32)))} is VALID [2020-07-29 01:06:06,216 INFO L263 TraceCheckUtils]: 16: Hoare triple {1057#(and (= entry_point_~p~1.base (_ bv0 32)) (= entry_point_~p~1.offset (_ bv0 32)))} call g5(~p~1.base, ~p~1.offset); {1061#(and (= |g5_#in~p.base| (_ bv0 32)) (= |g5_#in~p.offset| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,217 INFO L280 TraceCheckUtils]: 17: Hoare triple {1061#(and (= |g5_#in~p.base| (_ bv0 32)) (= |g5_#in~p.offset| (_ bv0 32)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1065#(and (= g5_~p.offset (_ bv0 32)) (= g5_~p.base (_ bv0 32)))} is VALID [2020-07-29 01:06:06,218 INFO L280 TraceCheckUtils]: 18: Hoare triple {1065#(and (= g5_~p.offset (_ bv0 32)) (= g5_~p.base (_ bv0 32)))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {1004#false} is VALID [2020-07-29 01:06:06,218 INFO L280 TraceCheckUtils]: 19: Hoare triple {1004#false} assume 0bv32 == ~p.offset; {1004#false} is VALID [2020-07-29 01:06:06,219 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#false} assume ~bvult32(~p.base, #StackHeapBarrier); {1004#false} is VALID [2020-07-29 01:06:06,219 INFO L280 TraceCheckUtils]: 21: Hoare triple {1004#false} assume !(0bv32 == ~p.base || 1bv1 == #valid[~p.base]); {1004#false} is VALID [2020-07-29 01:06:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:06,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:06,434 INFO L280 TraceCheckUtils]: 21: Hoare triple {1004#false} assume !(0bv32 == ~p.base || 1bv1 == #valid[~p.base]); {1004#false} is VALID [2020-07-29 01:06:06,435 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#false} assume ~bvult32(~p.base, #StackHeapBarrier); {1004#false} is VALID [2020-07-29 01:06:06,435 INFO L280 TraceCheckUtils]: 19: Hoare triple {1004#false} assume 0bv32 == ~p.offset; {1004#false} is VALID [2020-07-29 01:06:06,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {1065#(and (= g5_~p.offset (_ bv0 32)) (= g5_~p.base (_ bv0 32)))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {1004#false} is VALID [2020-07-29 01:06:06,436 INFO L280 TraceCheckUtils]: 17: Hoare triple {1061#(and (= |g5_#in~p.base| (_ bv0 32)) (= |g5_#in~p.offset| (_ bv0 32)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1065#(and (= g5_~p.offset (_ bv0 32)) (= g5_~p.base (_ bv0 32)))} is VALID [2020-07-29 01:06:06,438 INFO L263 TraceCheckUtils]: 16: Hoare triple {1057#(and (= entry_point_~p~1.base (_ bv0 32)) (= entry_point_~p~1.offset (_ bv0 32)))} call g5(~p~1.base, ~p~1.offset); {1061#(and (= |g5_#in~p.base| (_ bv0 32)) (= |g5_#in~p.offset| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {1053#(and (= |entry_point_#t~ret39.offset| (_ bv0 32)) (= |entry_point_#t~ret39.base| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1057#(and (= entry_point_~p~1.base (_ bv0 32)) (= entry_point_~p~1.offset (_ bv0 32)))} is VALID [2020-07-29 01:06:06,440 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} {1003#true} #446#return; {1053#(and (= |entry_point_#t~ret39.offset| (_ bv0 32)) (= |entry_point_#t~ret39.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} assume true; {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} is VALID [2020-07-29 01:06:06,441 INFO L280 TraceCheckUtils]: 12: Hoare triple {1042#(and (= (_ bv0 32) |h5_#t~ret38.offset|) (= (_ bv0 32) |h5_#t~ret38.base|))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1046#(and (= (_ bv0 32) |h5_#res.offset|) (= (_ bv0 32) |h5_#res.base|))} is VALID [2020-07-29 01:06:06,442 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1003#true} #442#return; {1042#(and (= (_ bv0 32) |h5_#t~ret38.offset|) (= (_ bv0 32) |h5_#t~ret38.base|))} is VALID [2020-07-29 01:06:06,443 INFO L280 TraceCheckUtils]: 10: Hoare triple {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,444 INFO L280 TraceCheckUtils]: 9: Hoare triple {1003#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1035#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:06,444 INFO L280 TraceCheckUtils]: 8: Hoare triple {1003#true} ~size := #in~size; {1003#true} is VALID [2020-07-29 01:06:06,445 INFO L263 TraceCheckUtils]: 7: Hoare triple {1003#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1003#true} is VALID [2020-07-29 01:06:06,445 INFO L263 TraceCheckUtils]: 6: Hoare triple {1003#true} call #t~ret39.base, #t~ret39.offset := h5(); {1003#true} is VALID [2020-07-29 01:06:06,445 INFO L263 TraceCheckUtils]: 5: Hoare triple {1003#true} call entry_point(); {1003#true} is VALID [2020-07-29 01:06:06,445 INFO L263 TraceCheckUtils]: 4: Hoare triple {1003#true} call main(); {1003#true} is VALID [2020-07-29 01:06:06,446 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #458#return; {1003#true} is VALID [2020-07-29 01:06:06,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2020-07-29 01:06:06,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1003#true} is VALID [2020-07-29 01:06:06,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2020-07-29 01:06:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:06,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700318531] [2020-07-29 01:06:06,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:06,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2020-07-29 01:06:06,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619937710] [2020-07-29 01:06:06,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-29 01:06:06,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:06,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:06:06,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:06,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:06:06,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:06:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:06:06,484 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 9 states. [2020-07-29 01:06:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:06,872 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-29 01:06:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:06:06,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-29 01:06:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-29 01:06:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-29 01:06:06,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2020-07-29 01:06:06,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:06,939 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:06:06,939 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:06:06,940 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:06:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:06:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-07-29 01:06:06,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:06,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2020-07-29 01:06:06,945 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2020-07-29 01:06:06,946 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2020-07-29 01:06:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:06,949 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-29 01:06:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-29 01:06:06,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:06,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:06,953 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2020-07-29 01:06:06,953 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2020-07-29 01:06:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:06,958 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-29 01:06:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-29 01:06:06,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:06,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:06,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:06,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:06:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2020-07-29 01:06:06,961 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2020-07-29 01:06:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:06,961 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2020-07-29 01:06:06,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:06:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-29 01:06:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:06:06,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:06,962 INFO L422 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] [2020-07-29 01:06:07,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:06:07,164 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -714793594, now seen corresponding path program 1 times [2020-07-29 01:06:07,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:07,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220666222] [2020-07-29 01:06:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:07,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:06:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:07,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:07,332 INFO L263 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2020-07-29 01:06:07,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {1307#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1307#true} is VALID [2020-07-29 01:06:07,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-29 01:06:07,333 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #458#return; {1307#true} is VALID [2020-07-29 01:06:07,334 INFO L263 TraceCheckUtils]: 4: Hoare triple {1307#true} call main(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,335 INFO L263 TraceCheckUtils]: 5: Hoare triple {1324#(= |#valid| |old(#valid)|)} call entry_point(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,335 INFO L263 TraceCheckUtils]: 6: Hoare triple {1324#(= |#valid| |old(#valid)|)} call #t~ret39.base, #t~ret39.offset := h5(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,336 INFO L263 TraceCheckUtils]: 7: Hoare triple {1324#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~size := #in~size; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,338 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #442#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,340 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #446#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,341 INFO L280 TraceCheckUtils]: 15: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,342 INFO L263 TraceCheckUtils]: 16: Hoare triple {1324#(= |#valid| |old(#valid)|)} call g5(~p~1.base, ~p~1.offset); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,343 INFO L280 TraceCheckUtils]: 17: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(~p.base != 0bv32 || ~p.offset != 0bv32); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,344 INFO L280 TraceCheckUtils]: 19: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,346 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #448#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,348 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #418#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,349 INFO L280 TraceCheckUtils]: 23: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1308#false} is VALID [2020-07-29 01:06:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:07,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:07,566 INFO L280 TraceCheckUtils]: 23: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1308#false} is VALID [2020-07-29 01:06:07,568 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #418#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,569 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #448#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,570 INFO L280 TraceCheckUtils]: 19: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,570 INFO L280 TraceCheckUtils]: 18: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(~p.base != 0bv32 || ~p.offset != 0bv32); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,571 INFO L263 TraceCheckUtils]: 16: Hoare triple {1324#(= |#valid| |old(#valid)|)} call g5(~p~1.base, ~p~1.offset); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,573 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #446#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,575 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1324#(= |#valid| |old(#valid)|)} {1324#(= |#valid| |old(#valid)|)} #442#return; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume true; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,576 INFO L280 TraceCheckUtils]: 9: Hoare triple {1324#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {1324#(= |#valid| |old(#valid)|)} ~size := #in~size; {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,578 INFO L263 TraceCheckUtils]: 7: Hoare triple {1324#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,578 INFO L263 TraceCheckUtils]: 6: Hoare triple {1324#(= |#valid| |old(#valid)|)} call #t~ret39.base, #t~ret39.offset := h5(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,579 INFO L263 TraceCheckUtils]: 5: Hoare triple {1324#(= |#valid| |old(#valid)|)} call entry_point(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,579 INFO L263 TraceCheckUtils]: 4: Hoare triple {1307#true} call main(); {1324#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:07,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #458#return; {1307#true} is VALID [2020-07-29 01:06:07,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-29 01:06:07,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {1307#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1307#true} is VALID [2020-07-29 01:06:07,580 INFO L263 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2020-07-29 01:06:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:07,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220666222] [2020-07-29 01:06:07,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:07,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:06:07,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339658515] [2020-07-29 01:06:07,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-29 01:06:07,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:07,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:06:07,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:07,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:06:07,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:06:07,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:06:07,651 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 3 states. [2020-07-29 01:06:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:07,745 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2020-07-29 01:06:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:06:07,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-29 01:06:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:06:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-29 01:06:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:06:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-29 01:06:07,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2020-07-29 01:06:07,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:07,813 INFO L225 Difference]: With dead ends: 42 [2020-07-29 01:06:07,813 INFO L226 Difference]: Without dead ends: 28 [2020-07-29 01:06:07,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:06:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-29 01:06:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-29 01:06:07,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:07,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-29 01:06:07,816 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-29 01:06:07,817 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-29 01:06:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:07,818 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-29 01:06:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-29 01:06:07,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:07,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:07,819 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-29 01:06:07,820 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-29 01:06:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:07,822 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-29 01:06:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-29 01:06:07,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:07,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:07,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:07,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:06:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2020-07-29 01:06:07,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 24 [2020-07-29 01:06:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:07,825 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2020-07-29 01:06:07,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:06:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-29 01:06:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-29 01:06:07,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:07,826 INFO L422 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] [2020-07-29 01:06:08,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:06:08,031 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, g5Err2ASSERT_VIOLATIONMEMORY_FREE, g5Err0ASSERT_VIOLATIONMEMORY_FREE, g5Err1ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash -745239103, now seen corresponding path program 1 times [2020-07-29 01:06:08,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:08,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358982870] [2020-07-29 01:06:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:08,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:06:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:08,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:12,532 INFO L263 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2020-07-29 01:06:12,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1579#true} is VALID [2020-07-29 01:06:12,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2020-07-29 01:06:12,533 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #458#return; {1579#true} is VALID [2020-07-29 01:06:12,535 INFO L263 TraceCheckUtils]: 4: Hoare triple {1579#true} call main(); {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,535 INFO L263 TraceCheckUtils]: 5: Hoare triple {1596#(= |#valid| |old(#valid)|)} call entry_point(); {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,536 INFO L263 TraceCheckUtils]: 6: Hoare triple {1596#(= |#valid| |old(#valid)|)} call #t~ret39.base, #t~ret39.offset := h5(); {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,536 INFO L263 TraceCheckUtils]: 7: Hoare triple {1596#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {1596#(= |#valid| |old(#valid)|)} ~size := #in~size; {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {1596#(= |#valid| |old(#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; {1612#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:12,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {1612#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} assume true; {1612#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:12,539 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1612#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} {1596#(= |#valid| |old(#valid)|)} #442#return; {1619#(and (= |#valid| (store |old(#valid)| |h5_#t~ret38.base| (_ bv1 1))) (= (select |old(#valid)| |h5_#t~ret38.base|) (_ bv0 1)))} is VALID [2020-07-29 01:06:12,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {1619#(and (= |#valid| (store |old(#valid)| |h5_#t~ret38.base| (_ bv1 1))) (= (select |old(#valid)| |h5_#t~ret38.base|) (_ bv0 1)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1623#(and (= (_ bv0 1) (select |old(#valid)| |h5_#res.base|)) (= |#valid| (store |old(#valid)| |h5_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:12,541 INFO L280 TraceCheckUtils]: 13: Hoare triple {1623#(and (= (_ bv0 1) (select |old(#valid)| |h5_#res.base|)) (= |#valid| (store |old(#valid)| |h5_#res.base| (_ bv1 1))))} assume true; {1623#(and (= (_ bv0 1) (select |old(#valid)| |h5_#res.base|)) (= |#valid| (store |old(#valid)| |h5_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:12,547 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1623#(and (= (_ bv0 1) (select |old(#valid)| |h5_#res.base|)) (= |#valid| (store |old(#valid)| |h5_#res.base| (_ bv1 1))))} {1596#(= |#valid| |old(#valid)|)} #446#return; {1630#(and (= (_ bv0 1) (select |old(#valid)| |entry_point_#t~ret39.base|)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret39.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:12,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {1630#(and (= (_ bv0 1) (select |old(#valid)| |entry_point_#t~ret39.base|)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret39.base| (_ bv1 1))))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1634#(and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv1 1))))} is VALID [2020-07-29 01:06:12,550 INFO L263 TraceCheckUtils]: 16: Hoare triple {1634#(and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv1 1))))} call g5(~p~1.base, ~p~1.offset); {1596#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:12,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {1596#(= |#valid| |old(#valid)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:06:12,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:06:12,552 INFO L280 TraceCheckUtils]: 19: Hoare triple {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} assume 0bv32 == ~p.offset; {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:06:12,553 INFO L280 TraceCheckUtils]: 20: Hoare triple {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} assume ~bvult32(~p.base, #StackHeapBarrier); {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:06:12,554 INFO L280 TraceCheckUtils]: 21: Hoare triple {1641#(and (= g5_~p.base |g5_#in~p.base|) (= |#valid| |old(#valid)|))} assume 0bv32 == ~p.base || 1bv1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); {1654#(= |#valid| (store |old(#valid)| |g5_#in~p.base| (_ bv0 1)))} is VALID [2020-07-29 01:06:12,555 INFO L280 TraceCheckUtils]: 22: Hoare triple {1654#(= |#valid| (store |old(#valid)| |g5_#in~p.base| (_ bv0 1)))} assume true; {1654#(= |#valid| (store |old(#valid)| |g5_#in~p.base| (_ bv0 1)))} is VALID [2020-07-29 01:06:12,558 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1654#(= |#valid| (store |old(#valid)| |g5_#in~p.base| (_ bv0 1)))} {1634#(and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv1 1))))} #448#return; {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} is VALID [2020-07-29 01:06:12,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} assume true; {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} is VALID [2020-07-29 01:06:12,560 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} {1596#(= |#valid| |old(#valid)|)} #418#return; {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} is VALID [2020-07-29 01:06:12,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {1661#(exists ((entry_point_~p~1.base (_ BitVec 32))) (and (= (select |old(#valid)| entry_point_~p~1.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| entry_point_~p~1.base (_ bv0 1)))))} assume !(#valid == old(#valid)); {1580#false} is VALID [2020-07-29 01:06:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:12,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:34,702 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:34,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |c_#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:34,774 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:34,838 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:34,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| c_g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:34,893 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:34,937 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:34,983 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:35,023 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:06:35,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_g5_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:35,043 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_g5_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) is different from true [2020-07-29 01:06:39,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_#t~ret39.base_36| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_36|) (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |c_old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))) is different from false [2020-07-29 01:06:39,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:06:39,360 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:06:39,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:39,384 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from true [2020-07-29 01:06:39,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:06:39,432 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:06:39,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:06:39,506 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:06:39,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:39,522 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from true [2020-07-29 01:06:39,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:06:39,658 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:06:39,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from false [2020-07-29 01:06:39,694 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) is different from true [2020-07-29 01:06:39,766 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-07-29 01:06:39,800 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2020-07-29 01:06:39,826 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:06:39,868 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:06:39,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |c_old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from false [2020-07-29 01:06:39,923 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |c_old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from true [2020-07-29 01:06:39,983 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:06:40,014 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:06:40,041 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:06:40,081 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:06:42,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:06:42,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:06:42,316 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:06:42,357 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:06:42,400 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |c_old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1))))) is different from true [2020-07-29 01:06:42,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:06:42,492 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:06:42,544 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:06:42,577 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:06:42,605 INFO L280 TraceCheckUtils]: 26: Hoare triple {1596#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1580#false} is VALID [2020-07-29 01:06:42,613 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1678#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} {1674#(forall ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~1.base_15) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~1.base_15 (_ bv0 1)))))} #418#return; {1596#(= |#valid| |old(#valid)|)} is UNKNOWN [2020-07-29 01:06:42,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {1678#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} assume true; {1678#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is VALID [2020-07-29 01:06:42,627 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1689#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} {1685#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| entry_point_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} #448#return; {1678#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is UNKNOWN [2020-07-29 01:06:42,628 INFO L280 TraceCheckUtils]: 22: Hoare triple {1689#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} assume true; {1689#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is VALID [2020-07-29 01:06:42,637 INFO L280 TraceCheckUtils]: 21: Hoare triple {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} assume 0bv32 == ~p.base || 1bv1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); {1689#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} assume ~bvult32(~p.base, #StackHeapBarrier); {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is VALID [2020-07-29 01:06:42,639 INFO L280 TraceCheckUtils]: 19: Hoare triple {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} assume 0bv32 == ~p.offset; {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is VALID [2020-07-29 01:06:42,639 INFO L280 TraceCheckUtils]: 18: Hoare triple {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} assume ~p.base != 0bv32 || ~p.offset != 0bv32; {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is VALID [2020-07-29 01:06:42,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {1709#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |g5_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1696#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,657 INFO L263 TraceCheckUtils]: 16: Hoare triple {1685#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| entry_point_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} call g5(~p~1.base, ~p~1.offset); {1709#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |g5_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |old(#valid)| |g5_#in~p.base| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {1713#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |entry_point_#t~ret39.base| (_ bv0 1)))))} ~p~1.base, ~p~1.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1685#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| entry_point_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is UNKNOWN [2020-07-29 01:06:42,673 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1721#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} {1717#(forall ((|v_entry_point_#t~ret39.base_36| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |#valid| |v_entry_point_#t~ret39.base_36|) (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))} #446#return; {1713#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |entry_point_#t~ret39.base| (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:06:42,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {1721#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} assume true; {1721#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} is VALID [2020-07-29 01:06:42,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset;#res.base, #res.offset := ~p~0.base, ~p~0.offset; {1721#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,720 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1736#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} {1732#(forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} #442#return; {1728#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,721 INFO L280 TraceCheckUtils]: 10: Hoare triple {1736#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} assume true; {1736#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} is VALID [2020-07-29 01:06:42,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1743#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {1736#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:06:42,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {1743#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} ~size := #in~size; {1743#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} is VALID [2020-07-29 01:06:42,772 INFO L263 TraceCheckUtils]: 7: Hoare triple {1732#(forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1743#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:06:42,781 INFO L263 TraceCheckUtils]: 6: Hoare triple {1717#(forall ((|v_entry_point_#t~ret39.base_36| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |#valid| |v_entry_point_#t~ret39.base_36|) (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))} call #t~ret39.base, #t~ret39.offset := h5(); {1732#(forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))} is UNKNOWN [2020-07-29 01:06:42,783 INFO L263 TraceCheckUtils]: 5: Hoare triple {1674#(forall ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~1.base_15) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~1.base_15 (_ bv0 1)))))} call entry_point(); {1717#(forall ((|v_entry_point_#t~ret39.base_36| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |#valid| |v_entry_point_#t~ret39.base_36|) (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_entry_point_~p~1.base_15)) (not (= (store |old(#valid)| v_entry_point_~p~1.base_15 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))} is VALID [2020-07-29 01:06:42,784 INFO L263 TraceCheckUtils]: 4: Hoare triple {1579#true} call main(); {1674#(forall ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~1.base_15) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~1.base_15 (_ bv0 1)))))} is VALID [2020-07-29 01:06:42,784 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #458#return; {1579#true} is VALID [2020-07-29 01:06:42,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2020-07-29 01:06:42,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);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); {1579#true} is VALID [2020-07-29 01:06:42,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2020-07-29 01:06:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:42,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358982870] [2020-07-29 01:06:42,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:42,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 15] imperfect sequences [] total 23 [2020-07-29 01:06:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201404491] [2020-07-29 01:06:42,796 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2020-07-29 01:06:42,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:42,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-29 01:06:43,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 30 inductive. 0 not inductive. 20 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:43,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-29 01:06:43,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-29 01:06:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=146, Unknown=47, NotChecked=306, Total=552 [2020-07-29 01:06:43,167 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 24 states. [2020-07-29 01:07:07,855 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_h5_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_h5_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_h5_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2020-07-29 01:07:08,058 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |c_old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_55|))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))) is different from false [2020-07-29 01:07:08,882 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (|v_h5_#t~ret38.base_66| (_ BitVec 32)) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_7 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_7 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))))) (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |c_old(#valid)| |v_h5_#t~ret38.base_66| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_h5_#t~ret38.base_66|)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36|)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2020-07-29 01:07:10,742 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_h5_#t~ret38.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_h5_#t~ret38.base|) (_ bv0 1))) is different from false [2020-07-29 01:07:10,746 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_h5_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_h5_#t~ret38.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_h5_#t~ret38.base|) (_ bv0 1))) is different from true [2020-07-29 01:07:10,975 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_old(#valid)| |c_h5_#res.base|)) (= |c_#valid| (store |c_old(#valid)| |c_h5_#res.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))) is different from false [2020-07-29 01:07:10,979 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_old(#valid)| |c_h5_#res.base|)) (= |c_#valid| (store |c_old(#valid)| |c_h5_#res.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_h5_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~1.base_15) (_ bv0 1)))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_36| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_#t~ret39.base_36|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_entry_point_#t~ret39.base_36| (_ bv0 1))))))))) is different from true [2020-07-29 01:07:17,733 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_g5_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2020-07-29 01:07:17,925 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| c_g5_~p.base (_ bv0 1))) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) (= c_g5_~p.base |c_g5_#in~p.base|) (= |c_#valid| |c_old(#valid)|)) is different from false [2020-07-29 01:07:18,540 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |c_#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~p~1.base_15 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~p~1.base_15)))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_g5_#in~p.base| (_ bv0 1)))) is different from false [2020-07-29 01:07:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:19,075 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-29 01:07:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-29 01:07:19,075 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2020-07-29 01:07:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:07:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2020-07-29 01:07:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:07:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2020-07-29 01:07:19,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 27 transitions. [2020-07-29 01:07:19,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 12 inductive. 0 not inductive. 15 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:19,451 INFO L225 Difference]: With dead ends: 27 [2020-07-29 01:07:19,452 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:07:19,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=69, Invalid=152, Unknown=57, NotChecked=714, Total=992 [2020-07-29 01:07:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:07:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:07:19,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:19,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:19,453 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:19,453 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:19,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:07:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:19,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:19,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:19,454 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:19,454 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:19,454 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:07:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:19,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:19,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:19,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:19,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:07:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:07:19,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-29 01:07:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:19,455 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:07:19,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-29 01:07:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:19,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:19,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:07:19,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:07:19 BoogieIcfgContainer [2020-07-29 01:07:19,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:07:19,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:07:19,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:07:19,668 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:07:19,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:00" (3/4) ... [2020-07-29 01:07:19,671 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:07:19,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2020-07-29 01:07:19,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2020-07-29 01:07:19,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g5 [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2020-07-29 01:07:19,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure h5 [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2020-07-29 01:07:19,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2020-07-29 01:07:19,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:07:19,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2020-07-29 01:07:19,683 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2020-07-29 01:07:19,683 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2020-07-29 01:07:19,683 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2020-07-29 01:07:19,691 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2020-07-29 01:07:19,691 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-07-29 01:07:19,692 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:07:19,692 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:07:19,692 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:07:19,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:07:19,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:07:19,754 INFO L168 Benchmark]: Toolchain (without parser) took 82668.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -323.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:07:19,757 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:07:19,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 966.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:19,758 INFO L168 Benchmark]: Boogie Preprocessor took 133.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:19,759 INFO L168 Benchmark]: RCFGBuilder took 1815.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 874.2 MB in the end (delta: 170.8 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:19,759 INFO L168 Benchmark]: TraceAbstraction took 79661.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.2 MB). Free memory was 874.2 MB in the beginning and 1.3 GB in the end (delta: -416.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:07:19,760 INFO L168 Benchmark]: Witness Printer took 84.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:19,762 INFO L336 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 966.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1815.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 874.2 MB in the end (delta: 170.8 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79661.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.2 MB). Free memory was 874.2 MB in the beginning and 1.3 GB in the end (delta: -416.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 770]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 344 locations, 74 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 79.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 72 SDslu, 678 SDs, 0 SdLazy, 521 SolverSat, 21 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 24 QuantifiedInterpolants, 47218 SizeOfPredicates, 21 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...