./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43035c6e49855e15ec870efd7c9282b8311d43cd ............................................................................................................................ 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 -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_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43035c6e49855e15ec870efd7c9282b8311d43cd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 18:53:04,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:53:04,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:53:04,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:53:04,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:53:04,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:53:04,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:53:04,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:53:04,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:53:04,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:53:04,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:53:04,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:53:04,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:53:04,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:53:04,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:53:04,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:53:04,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:53:04,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:53:04,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:53:04,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:53:04,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:53:04,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:53:04,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:53:04,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:53:04,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:53:04,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:53:04,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:53:04,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:53:04,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:53:04,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:53:04,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:53:04,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:53:04,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:53:04,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:53:04,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:53:04,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:53:04,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:53:04,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:53:04,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:53:04,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:53:04,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:53:04,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 18:53:04,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:53:04,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:53:04,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:53:04,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:53:04,910 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:53:04,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:53:04,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:53:04,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:53:04,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:53:04,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:53:04,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:53:04,913 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:53:04,913 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:53:04,914 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:53:04,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:53:04,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:53:04,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:53:04,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:53:04,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:53:04,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:53:04,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:53:04,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:53:04,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:53:04,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:53:04,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:53:04,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:53:04,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:53:04,917 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 -> 43035c6e49855e15ec870efd7c9282b8311d43cd [2019-11-27 18:53:05,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:53:05,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:53:05,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:53:05,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:53:05,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:53:05,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-27 18:53:05,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c592702/f0b793d4936e4ffd9f3b77bce5d47274/FLAGed70d9ef8 [2019-11-27 18:53:05,960 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:53:05,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-27 18:53:05,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c592702/f0b793d4936e4ffd9f3b77bce5d47274/FLAGed70d9ef8 [2019-11-27 18:53:06,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c592702/f0b793d4936e4ffd9f3b77bce5d47274 [2019-11-27 18:53:06,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:53:06,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:53:06,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:53:06,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:53:06,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:53:06,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:53:06" (1/1) ... [2019-11-27 18:53:06,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4c1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:06, skipping insertion in model container [2019-11-27 18:53:06,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:53:06" (1/1) ... [2019-11-27 18:53:06,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:53:06,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:53:06,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:53:06,813 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) [2019-11-27 18:53:06,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63608cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:06, skipping insertion in model container [2019-11-27 18:53:06,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:53:06,815 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 18:53:06,818 INFO L168 Benchmark]: Toolchain (without parser) took 624.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 18:53:06,820 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:53:06,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-27 18:53:06,827 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 15.1 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.24-3c39aff [2019-11-27 18:53:08,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:53:08,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:53:08,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:53:08,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:53:08,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:53:08,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:53:08,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:53:08,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:53:08,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:53:08,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:53:08,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:53:08,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:53:08,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:53:08,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:53:08,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:53:08,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:53:08,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:53:08,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:53:08,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:53:08,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:53:08,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:53:08,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:53:08,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:53:08,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:53:08,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:53:08,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:53:08,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:53:08,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:53:08,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:53:08,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:53:08,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:53:08,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:53:08,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:53:08,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:53:08,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:53:08,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:53:08,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:53:08,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:53:08,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:53:08,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:53:08,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 18:53:08,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:53:08,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:53:08,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:53:08,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:53:08,803 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:53:08,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:53:08,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:53:08,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:53:08,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:53:08,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:53:08,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:53:08,806 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:53:08,806 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:53:08,806 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:53:08,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:53:08,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:53:08,807 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:53:08,807 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:53:08,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:53:08,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:53:08,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:53:08,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:53:08,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:53:08,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:53:08,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:53:08,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:53:08,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:53:08,809 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:53:08,810 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:53:08,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:53:08,810 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 -> 43035c6e49855e15ec870efd7c9282b8311d43cd [2019-11-27 18:53:09,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:53:09,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:53:09,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:53:09,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:53:09,129 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:53:09,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-27 18:53:09,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae31a87a/cb7b4e67d08a497f89f25bb90db8662e/FLAG67d81ed3c [2019-11-27 18:53:09,805 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:53:09,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-27 18:53:09,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae31a87a/cb7b4e67d08a497f89f25bb90db8662e/FLAG67d81ed3c [2019-11-27 18:53:10,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae31a87a/cb7b4e67d08a497f89f25bb90db8662e [2019-11-27 18:53:10,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:53:10,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:53:10,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:53:10,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:53:10,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:53:10,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c90127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10, skipping insertion in model container [2019-11-27 18:53:10,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:53:10,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:53:10,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:53:10,663 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 18:53:10,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:53:10,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:53:10,765 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:53:10,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:53:10,906 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:53:10,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10 WrapperNode [2019-11-27 18:53:10,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:53:10,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:53:10,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:53:10,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:53:10,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:10,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:11,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:11,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (1/1) ... [2019-11-27 18:53:11,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:53:11,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:53:11,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:53:11,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:53:11,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (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 [2019-11-27 18:53:11,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 18:53:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:53:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:53:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:53:11,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 18:53:11,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 18:53:11,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 18:53:11,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 18:53:11,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 18:53:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 18:53:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 18:53:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 18:53:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 18:53:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 18:53:11,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 18:53:11,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 18:53:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 18:53:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 18:53:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 18:53:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 18:53:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 18:53:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_10 [2019-11-27 18:53:11,083 INFO L138 BoogieDeclarations]: Found implementation of procedure free_10 [2019-11-27 18:53:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 18:53:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 18:53:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 18:53:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 18:53:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 18:53:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 18:53:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 18:53:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 18:53:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 18:53:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 18:53:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 18:53:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 18:53:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 18:53:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 18:53:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 18:53:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 18:53:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 18:53:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 18:53:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 18:53:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 18:53:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 18:53:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 18:53:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 18:53:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 18:53:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 18:53:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_10 [2019-11-27 18:53:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure free_10 [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:53:11,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 18:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 18:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 18:53:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 18:53:11,786 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:53:12,232 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:53:12,793 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:53:12,794 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 18:53:12,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:53:12 BoogieIcfgContainer [2019-11-27 18:53:12,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:53:12,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:53:12,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:53:12,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:53:12,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:53:10" (1/3) ... [2019-11-27 18:53:12,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:53:12, skipping insertion in model container [2019-11-27 18:53:12,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:53:10" (2/3) ... [2019-11-27 18:53:12,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:53:12, skipping insertion in model container [2019-11-27 18:53:12,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:53:12" (3/3) ... [2019-11-27 18:53:12,807 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test10-2.i [2019-11-27 18:53:12,817 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:53:12,830 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 113 error locations. [2019-11-27 18:53:12,845 INFO L249 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2019-11-27 18:53:12,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:53:12,872 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 18:53:12,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:53:12,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:53:12,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:53:12,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:53:12,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:53:12,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:53:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states. [2019-11-27 18:53:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:53:12,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:53:12,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:53:12,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:53:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:53:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 307732063, now seen corresponding path program 1 times [2019-11-27 18:53:12,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:53:12,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286323906] [2019-11-27 18:53:12,950 INFO L94 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 [2019-11-27 18:53:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:53:13,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:53:13,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:53:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:13,255 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:53:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:13,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286323906] [2019-11-27 18:53:13,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:53:13,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:53:13,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071696873] [2019-11-27 18:53:13,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:53:13,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:53:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:53:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:53:13,407 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 5 states. [2019-11-27 18:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:53:13,797 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2019-11-27 18:53:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:53:13,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-27 18:53:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:53:13,827 INFO L225 Difference]: With dead ends: 163 [2019-11-27 18:53:13,828 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 18:53:13,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:53:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 18:53:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2019-11-27 18:53:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-27 18:53:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-11-27 18:53:13,958 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 16 [2019-11-27 18:53:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:53:13,959 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-11-27 18:53:13,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:53:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-11-27 18:53:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:53:13,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:53:13,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:53:14,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:53:14,185 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:53:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:53:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2050542398, now seen corresponding path program 1 times [2019-11-27 18:53:14,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:53:14,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320543084] [2019-11-27 18:53:14,186 INFO L94 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 [2019-11-27 18:53:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:53:14,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 18:53:14,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:53:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:14,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:53:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:14,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320543084] [2019-11-27 18:53:14,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:53:14,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:53:14,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126933965] [2019-11-27 18:53:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 18:53:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:53:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 18:53:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:53:14,414 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 3 states. [2019-11-27 18:53:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:53:14,716 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2019-11-27 18:53:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 18:53:14,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 18:53:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:53:14,721 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:53:14,722 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:53:14,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:53:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:53:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2019-11-27 18:53:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-27 18:53:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-11-27 18:53:14,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2019-11-27 18:53:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:53:14,751 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-11-27 18:53:14,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 18:53:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-11-27 18:53:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 18:53:14,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:53:14,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:53:14,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:53:14,954 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:53:14,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:53:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash 503598229, now seen corresponding path program 1 times [2019-11-27 18:53:14,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:53:14,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738557438] [2019-11-27 18:53:14,960 INFO L94 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 [2019-11-27 18:53:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:53:15,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:53:15,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:53:15,196 INFO L377 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 [2019-11-27 18:53:15,197 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:53:15,203 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:53:15,203 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:53:15,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:53:15,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:53:15,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 18:53:15,318 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:53:15,342 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-27 18:53:15,343 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 18:53:15,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-27 18:53:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:15,377 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:53:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:53:17,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738557438] [2019-11-27 18:53:17,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:53:17,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-27 18:53:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267013484] [2019-11-27 18:53:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 18:53:17,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:53:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 18:53:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2019-11-27 18:53:17,775 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 13 states. [2019-11-27 18:53:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:53:59,753 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2019-11-27 18:53:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:53:59,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-11-27 18:53:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:53:59,758 INFO L225 Difference]: With dead ends: 233 [2019-11-27 18:53:59,762 INFO L226 Difference]: Without dead ends: 233 [2019-11-27 18:53:59,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=84, Invalid=295, Unknown=1, NotChecked=0, Total=380 [2019-11-27 18:53:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-27 18:53:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 119. [2019-11-27 18:53:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-27 18:53:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2019-11-27 18:53:59,792 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 19 [2019-11-27 18:53:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:53:59,797 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2019-11-27 18:53:59,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 18:53:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2019-11-27 18:53:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 18:53:59,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:53:59,798 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:54:00,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:54:00,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:54:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:54:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash 503598230, now seen corresponding path program 1 times [2019-11-27 18:54:00,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:54:00,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785364814] [2019-11-27 18:54:00,014 INFO L94 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 [2019-11-27 18:54:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:54:00,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-27 18:54:00,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:54:00,179 INFO L377 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 [2019-11-27 18:54:00,179 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:00,192 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:00,197 INFO L377 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 [2019-11-27 18:54:00,197 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:00,209 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:00,210 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:54:00,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-27 18:54:02,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:54:02,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-27 18:54:02,389 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:02,423 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:02,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:02,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-27 18:54:02,446 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:02,461 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:02,463 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:54:02,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2019-11-27 18:54:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:54:02,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:54:02,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:54:02,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:54:02,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:54:02,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:54:05,704 WARN L192 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-27 18:54:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:54:09,265 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-27 18:54:09,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 18:54:09,281 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:09,295 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:09,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:54:09,299 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:54:09,311 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:54:09,312 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:54:09,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:8 [2019-11-27 18:54:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:54:09,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785364814] [2019-11-27 18:54:09,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:54:09,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-27 18:54:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57342866] [2019-11-27 18:54:09,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:54:09,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:54:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:54:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=200, Unknown=3, NotChecked=0, Total=240 [2019-11-27 18:54:09,412 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 16 states. [2019-11-27 18:54:15,567 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvule v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1)) (not (bvule (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (bvule .cse0 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|)))) is different from false [2019-11-27 18:54:55,298 WARN L192 SmtUtils]: Spent 23.33 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-27 18:55:16,787 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#length| c_entry_point_~a10~0.base) (_ bv4294967292 32)) (_ bv0 32)) (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvule v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1)) (not (bvule (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (bvule .cse0 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (= (_ bv0 32) c_entry_point_~a10~0.offset) (= (bvadd (select |c_#valid| c_entry_point_~a10~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|)))) is different from false [2019-11-27 18:55:46,361 WARN L192 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-11-27 18:55:55,266 WARN L192 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2019-11-27 18:56:26,664 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-27 18:56:28,741 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvule v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1)) (not (bvule (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (bvule .cse0 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4))))) (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-27 18:57:33,885 WARN L192 SmtUtils]: Spent 12.88 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-11-27 18:59:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:12,339 INFO L93 Difference]: Finished difference Result 250 states and 285 transitions. [2019-11-27 18:59:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-27 18:59:12,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-11-27 18:59:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:12,342 INFO L225 Difference]: With dead ends: 250 [2019-11-27 18:59:12,342 INFO L226 Difference]: Without dead ends: 250 [2019-11-27 18:59:12,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=12, NotChecked=144, Total=756 [2019-11-27 18:59:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-27 18:59:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 155. [2019-11-27 18:59:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 18:59:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2019-11-27 18:59:12,359 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 19 [2019-11-27 18:59:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:12,360 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2019-11-27 18:59:12,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:59:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2019-11-27 18:59:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 18:59:12,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:12,361 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:12,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:59:12,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1293353130, now seen corresponding path program 1 times [2019-11-27 18:59:12,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:12,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981973427] [2019-11-27 18:59:12,567 INFO L94 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 [2019-11-27 18:59:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:12,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:59:12,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:59:12,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:12,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981973427] [2019-11-27 18:59:12,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:59:12,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-11-27 18:59:12,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078528985] [2019-11-27 18:59:12,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:59:12,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:59:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:59:12,749 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand 5 states. [2019-11-27 18:59:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:12,800 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2019-11-27 18:59:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:59:12,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-27 18:59:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:12,803 INFO L225 Difference]: With dead ends: 136 [2019-11-27 18:59:12,803 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 18:59:12,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:59:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 18:59:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-27 18:59:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-27 18:59:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2019-11-27 18:59:12,818 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 19 [2019-11-27 18:59:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:12,818 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2019-11-27 18:59:12,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:59:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2019-11-27 18:59:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 18:59:12,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:12,820 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:13,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 18:59:13,022 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash -943570788, now seen corresponding path program 1 times [2019-11-27 18:59:13,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:13,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283733817] [2019-11-27 18:59:13,023 INFO L94 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 [2019-11-27 18:59:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:13,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 18:59:13,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:13,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 18:59:13,189 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:13,196 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:13,197 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:13,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-27 18:59:13,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-27 18:59:13,211 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:13,213 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:13,214 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:13,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-27 18:59:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:13,223 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:13,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283733817] [2019-11-27 18:59:13,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:13,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-27 18:59:13,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540315111] [2019-11-27 18:59:13,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:59:13,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:59:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:59:13,257 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand 6 states. [2019-11-27 18:59:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:13,439 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2019-11-27 18:59:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:59:13,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 18:59:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:13,442 INFO L225 Difference]: With dead ends: 137 [2019-11-27 18:59:13,442 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 18:59:13,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:59:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 18:59:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-11-27 18:59:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-27 18:59:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2019-11-27 18:59:13,450 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 24 [2019-11-27 18:59:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:13,451 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2019-11-27 18:59:13,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:59:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2019-11-27 18:59:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 18:59:13,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:13,452 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:13,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 18:59:13,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1543942045, now seen corresponding path program 1 times [2019-11-27 18:59:13,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:13,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209741161] [2019-11-27 18:59:13,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:13,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:59:13,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:59:13,989 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:14,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209741161] [2019-11-27 18:59:14,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:14,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-11-27 18:59:14,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972536525] [2019-11-27 18:59:14,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:59:14,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:59:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:59:14,126 INFO L87 Difference]: Start difference. First operand 134 states and 169 transitions. Second operand 10 states. [2019-11-27 18:59:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:14,542 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2019-11-27 18:59:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:59:14,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 18:59:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:14,544 INFO L225 Difference]: With dead ends: 137 [2019-11-27 18:59:14,544 INFO L226 Difference]: Without dead ends: 135 [2019-11-27 18:59:14,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:59:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-27 18:59:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-27 18:59:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-27 18:59:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2019-11-27 18:59:14,553 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 24 [2019-11-27 18:59:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:14,554 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2019-11-27 18:59:14,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:59:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2019-11-27 18:59:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 18:59:14,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:14,555 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:14,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 18:59:14,776 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 304570972, now seen corresponding path program 1 times [2019-11-27 18:59:14,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:14,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8711167] [2019-11-27 18:59:14,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:14,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:59:14,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:14,973 INFO L377 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 [2019-11-27 18:59:14,974 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:14,976 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:14,976 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:14,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:15,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 18:59:15,004 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:15,012 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:15,013 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:15,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-27 18:59:15,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-27 18:59:15,026 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:15,028 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:15,029 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:15,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-27 18:59:15,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:15,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-27 18:59:15,094 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:15,118 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-27 18:59:15,119 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 18:59:15,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-27 18:59:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:15,147 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 18:59:17,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8711167] [2019-11-27 18:59:17,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:17,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-27 18:59:17,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410819704] [2019-11-27 18:59:17,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 18:59:17,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 18:59:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=172, Unknown=1, NotChecked=0, Total=210 [2019-11-27 18:59:17,556 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand 15 states. [2019-11-27 19:00:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:00:08,680 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2019-11-27 19:00:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 19:00:08,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-11-27 19:00:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:00:08,683 INFO L225 Difference]: With dead ends: 175 [2019-11-27 19:00:08,683 INFO L226 Difference]: Without dead ends: 175 [2019-11-27 19:00:08,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=90, Invalid=371, Unknown=1, NotChecked=0, Total=462 [2019-11-27 19:00:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-27 19:00:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2019-11-27 19:00:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-27 19:00:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions. [2019-11-27 19:00:08,691 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 29 [2019-11-27 19:00:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:00:08,692 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 170 transitions. [2019-11-27 19:00:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 19:00:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions. [2019-11-27 19:00:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 19:00:08,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:00:08,694 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:00:08,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 19:00:08,895 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 19:00:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:00:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 304570973, now seen corresponding path program 1 times [2019-11-27 19:00:08,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:00:08,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887470022] [2019-11-27 19:00:08,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 19:00:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:00:09,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-27 19:00:09,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:00:09,085 INFO L377 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 [2019-11-27 19:00:09,085 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,093 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,098 INFO L377 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 [2019-11-27 19:00:09,098 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,106 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,107 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-27 19:00:09,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 19:00:09,149 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,163 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 19:00:09,169 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,179 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,180 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:30 [2019-11-27 19:00:09,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-27 19:00:09,215 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,225 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 19:00:09,231 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,245 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:09,245 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:00:09,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2019-11-27 19:00:11,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:00:11,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-27 19:00:11,370 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:11,385 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:11,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:11,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-27 19:00:11,402 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:11,417 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:11,418 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:00:11,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2019-11-27 19:00:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 19:00:11,443 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:00:11,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:00:11,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:00:11,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:00:11,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:00:14,890 WARN L192 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-27 19:00:14,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:00:18,198 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-27 19:00:18,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:00:18,204 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:18,216 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:18,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 19:00:18,220 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:00:18,228 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:00:18,228 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:00:18,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:8 [2019-11-27 19:00:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 19:00:18,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887470022] [2019-11-27 19:00:18,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:00:18,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-27 19:00:18,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328905235] [2019-11-27 19:00:18,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 19:00:18,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:00:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 19:00:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=261, Unknown=3, NotChecked=0, Total=306 [2019-11-27 19:00:18,326 INFO L87 Difference]: Start difference. First operand 136 states and 170 transitions. Second operand 18 states. [2019-11-27 19:00:39,040 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((v_prenex_4 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (not (bvule (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_4 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) (bvule .cse0 (select |c_#length| |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvule |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse0))))) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#t~malloc12.base_54| (_ BitVec 32)) (|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse1 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_54|) (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (not (bvule (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_4 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) (bvule .cse1 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_54| ldv_malloc_~size) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvule |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse1))))) (exists ((|v_ldv_malloc_#t~malloc12.base_53| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_53|) (_ bv0 1)))) is different from false [2019-11-27 19:00:41,064 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((v_prenex_4 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (not (bvule (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_4 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) (bvule .cse0 (select |c_#length| |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvule |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse0))))) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (exists ((|v_ldv_malloc_#t~malloc12.base_53| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_53|) (_ bv0 1)))) is different from false [2019-11-27 19:00:58,691 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((v_prenex_4 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (not (bvule (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_4 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) (bvule .cse0 (select |c_#length| |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvule |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse0))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ldv_malloc_#t~malloc12.base_53| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_53|) (_ bv0 1)))) is different from false [2019-11-27 19:01:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:41,163 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2019-11-27 19:01:41,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 19:01:41,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-27 19:01:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:41,169 INFO L225 Difference]: With dead ends: 139 [2019-11-27 19:01:41,169 INFO L226 Difference]: Without dead ends: 139 [2019-11-27 19:01:41,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=74, Invalid=393, Unknown=7, NotChecked=126, Total=600 [2019-11-27 19:01:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-27 19:01:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-11-27 19:01:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-27 19:01:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2019-11-27 19:01:41,177 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 29 [2019-11-27 19:01:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:41,177 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2019-11-27 19:01:41,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 19:01:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2019-11-27 19:01:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 19:01:41,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:41,179 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:41,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 19:01:41,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, __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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_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, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 19:01:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1801581997, now seen corresponding path program 1 times [2019-11-27 19:01:41,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:41,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772899268] [2019-11-27 19:01:41,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 19:01:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:41,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 19:01:41,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:01:43,625 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:48,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 19:01:48,014 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 19:01:48,021 INFO L168 Benchmark]: Toolchain (without parser) took 518013.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -272.4 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-27 19:01:48,021 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:01:48,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-27 19:01:48,022 INFO L168 Benchmark]: Boogie Preprocessor took 113.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:01:48,023 INFO L168 Benchmark]: RCFGBuilder took 1775.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 127.3 MB). Peak memory consumption was 127.3 MB. Max. memory is 11.5 GB. [2019-11-27 19:01:48,024 INFO L168 Benchmark]: TraceAbstraction took 515221.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 976.4 MB in the beginning and 1.2 GB in the end (delta: -245.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:01:48,026 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 898.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1775.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 127.3 MB). Peak memory consumption was 127.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 515221.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 976.4 MB in the beginning and 1.2 GB in the end (delta: -245.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...