./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 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_test22_2-1.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 2a86b9fab61553f9a54467f5b62ac500f38719cf ............................................................................................................................ 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_test22_2-1.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 2a86b9fab61553f9a54467f5b62ac500f38719cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:53:31,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:53:31,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:53:31,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:53:31,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:53:31,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:53:31,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:53:31,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:53:31,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:53:31,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:53:31,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:53:31,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:53:31,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:53:31,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:53:31,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:53:31,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:53:31,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:53:31,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:53:31,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:53:31,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:53:31,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:53:31,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:53:31,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:53:31,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:53:31,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:53:31,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:53:31,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:53:31,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:53:31,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:53:31,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:53:31,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:53:31,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:53:31,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:53:31,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:53:31,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:53:31,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:53:31,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:53:31,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:53:31,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:53:31,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:53:31,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:53:31,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 13:53:31,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:53:31,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:53:31,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:53:31,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:53:31,946 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:53:31,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:53:31,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:53:31,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:53:31,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:53:31,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:53:31,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:53:31,947 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:53:31,948 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:53:31,948 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:53:31,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:53:31,949 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:53:31,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:53:31,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:53:31,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:53:31,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:53:31,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:53:31,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:53:31,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:53:31,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:53:31,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:53:31,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:53:31,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:53:31,952 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 -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 13:53:32,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:53:32,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:53:32,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:53:32,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:53:32,314 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:53:32,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:53:32,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce1e76f8/59911e61f7d64ca09a0344efc903196b/FLAGfda2cda8e [2019-11-25 13:53:32,922 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:53:32,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:53:32,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce1e76f8/59911e61f7d64ca09a0344efc903196b/FLAGfda2cda8e [2019-11-25 13:53:33,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce1e76f8/59911e61f7d64ca09a0344efc903196b [2019-11-25 13:53:33,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:53:33,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:53:33,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:53:33,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:53:33,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:53:33,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:53:33" (1/1) ... [2019-11-25 13:53:33,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236deb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:33, skipping insertion in model container [2019-11-25 13:53:33,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:53:33" (1/1) ... [2019-11-25 13:53:33,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:53:33,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:53:33,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:53:33,957 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-25 13:53:33,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73160a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:33, skipping insertion in model container [2019-11-25 13:53:33,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:53:33,958 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:53:33,961 INFO L168 Benchmark]: Toolchain (without parser) took 607.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:53:33,962 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:53:33,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:53:33,965 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: 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-7c71bc2 [2019-11-25 13:53:35,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:53:35,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:53:35,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:53:35,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:53:35,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:53:35,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:53:35,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:53:35,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:53:35,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:53:35,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:53:35,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:53:35,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:53:35,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:53:35,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:53:35,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:53:35,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:53:35,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:53:35,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:53:35,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:53:35,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:53:35,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:53:35,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:53:35,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:53:35,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:53:35,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:53:35,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:53:35,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:53:35,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:53:35,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:53:35,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:53:35,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:53:35,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:53:35,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:53:35,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:53:35,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:53:35,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:53:35,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:53:35,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:53:35,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:53:35,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:53:35,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 13:53:35,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:53:35,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:53:35,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:53:35,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:53:35,787 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:53:35,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:53:35,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:53:35,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:53:35,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:53:35,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:53:35,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:53:35,789 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:53:35,789 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:53:35,789 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:53:35,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:53:35,790 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:53:35,790 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:53:35,790 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:53:35,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:53:35,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:53:35,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:53:35,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:53:35,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:53:35,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:53:35,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:53:35,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:53:35,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:53:35,793 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:53:35,794 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:53:35,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:53:35,794 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 -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 13:53:36,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:53:36,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:53:36,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:53:36,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:53:36,119 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:53:36,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:53:36,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176acc160/22ee7c6ff2144532af4a695303dca47c/FLAG544c98ed8 [2019-11-25 13:53:36,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:53:36,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:53:36,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176acc160/22ee7c6ff2144532af4a695303dca47c/FLAG544c98ed8 [2019-11-25 13:53:37,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176acc160/22ee7c6ff2144532af4a695303dca47c [2019-11-25 13:53:37,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:53:37,043 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:53:37,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:53:37,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:53:37,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:53:37,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f4497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37, skipping insertion in model container [2019-11-25 13:53:37,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:53:37,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:53:37,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:53:37,679 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:53:37,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:53:37,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:53:37,777 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:53:37,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:53:37,922 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:53:37,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37 WrapperNode [2019-11-25 13:53:37,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:53:37,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:53:37,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:53:37,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:53:37,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:37,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:38,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:38,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (1/1) ... [2019-11-25 13:53:38,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:53:38,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:53:38,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:53:38,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:53:38,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (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-25 13:53:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:53:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:53:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:53:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:53:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:53:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:53:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:53:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:53:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:53:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:53:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:53:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:53:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:53:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:53:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:53:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:53:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:53:38,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:53:38,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:53:38,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:53:38,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:53:38,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:53:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:53:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:53:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:53:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:53:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:53:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:53:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:53:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:53:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:53:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:53:38,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:53:38,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:53:38,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:53:38,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:53:38,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:53:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:53:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:53:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:53:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:53:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:53:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:53:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:53:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:53:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:53:38,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:53:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:53:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:53:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:53:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:53:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:53:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:53:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:53:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:53:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:53:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:53:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:53:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:53:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:53:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:53:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:53:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:53:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:53:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:53:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:53:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:53:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:53:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:53:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:53:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:53:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:53:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:53:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:53:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:53:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:53:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:53:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:53:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:53:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:53:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:53:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:53:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:53:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:53:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:53:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:53:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:53:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:53:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:53:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:53:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:53:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:53:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:53:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:53:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:53:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:53:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:53:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:53:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:53:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:53:38,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:53:38,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:53:38,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:53:38,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:53:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:53:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:53:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:53:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:53:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:53:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:53:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:53:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:53:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:53:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:53:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:53:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:53:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:53:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:53:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:53:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:53:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:53:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:53:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:53:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:53:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:53:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:53:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:53:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:53:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:53:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:53:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:53:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:53:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:53:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:53:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:53:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:53:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:53:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:53:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:53:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:53:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:53:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:53:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:53:38,774 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:53:39,155 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:53:39,472 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:53:39,472 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 13:53:39,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:53:39 BoogieIcfgContainer [2019-11-25 13:53:39,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:53:39,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:53:39,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:53:39,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:53:39,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:53:37" (1/3) ... [2019-11-25 13:53:39,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575cfe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:53:39, skipping insertion in model container [2019-11-25 13:53:39,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:53:37" (2/3) ... [2019-11-25 13:53:39,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575cfe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:53:39, skipping insertion in model container [2019-11-25 13:53:39,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:53:39" (3/3) ... [2019-11-25 13:53:39,483 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2019-11-25 13:53:39,493 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:53:39,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 13:53:39,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 13:53:39,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:53:39,532 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:53:39,533 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:53:39,533 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:53:39,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:53:39,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:53:39,534 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:53:39,534 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:53:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-25 13:53:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:53:39,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:39,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:39,565 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -896940051, now seen corresponding path program 1 times [2019-11-25 13:53:39,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:39,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162813623] [2019-11-25 13:53:39,585 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-25 13:53:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:39,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:53:39,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:39,901 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-25 13:53:39,902 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:39,913 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:39,914 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:39,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:39,954 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-25 13:53:39,954 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:40,023 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-25 13:53:40,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162813623] [2019-11-25 13:53:40,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:40,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:53:40,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045563069] [2019-11-25 13:53:40,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:53:40,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:53:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:53:40,066 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-11-25 13:53:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:40,290 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-11-25 13:53:40,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:53:40,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:53:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:40,324 INFO L225 Difference]: With dead ends: 74 [2019-11-25 13:53:40,331 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 13:53:40,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-25 13:53:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 13:53:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-25 13:53:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 13:53:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-25 13:53:40,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2019-11-25 13:53:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:40,400 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-25 13:53:40,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:53:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-25 13:53:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:53:40,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:40,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:40,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:53:40,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash -896940050, now seen corresponding path program 1 times [2019-11-25 13:53:40,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:40,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612492293] [2019-11-25 13:53:40,619 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-25 13:53:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:40,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:53:40,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:40,801 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-25 13:53:40,801 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:40,811 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:40,812 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:40,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:40,864 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-25 13:53:40,865 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:41,185 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-25 13:53:41,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612492293] [2019-11-25 13:53:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:53:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663360441] [2019-11-25 13:53:41,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:53:41,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:53:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:53:41,190 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2019-11-25 13:53:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:41,663 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-25 13:53:41,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:53:41,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 13:53:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:41,666 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:53:41,666 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 13:53:41,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:53:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 13:53:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-25 13:53:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 13:53:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-25 13:53:41,677 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2019-11-25 13:53:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:41,678 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-25 13:53:41,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:53:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-25 13:53:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:53:41,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:41,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:41,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:53:41,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash -868310900, now seen corresponding path program 1 times [2019-11-25 13:53:41,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:41,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814083157] [2019-11-25 13:53:41,884 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-25 13:53:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:42,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:53:42,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:42,094 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-25 13:53:42,095 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:42,138 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-25 13:53:42,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814083157] [2019-11-25 13:53:42,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:42,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:53:42,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728433294] [2019-11-25 13:53:42,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:53:42,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:53:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:53:42,140 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2019-11-25 13:53:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:42,164 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-25 13:53:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:53:42,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:53:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:42,166 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:53:42,166 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:53:42,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-25 13:53:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:53:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 13:53:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 13:53:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-25 13:53:42,173 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2019-11-25 13:53:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-25 13:53:42,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:53:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-25 13:53:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:53:42,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:42,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:42,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:53:42,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2008128002, now seen corresponding path program 1 times [2019-11-25 13:53:42,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:42,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799411280] [2019-11-25 13:53:42,395 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-25 13:53:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:42,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:53:42,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:42,533 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-25 13:53:42,533 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:42,650 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-25 13:53:42,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799411280] [2019-11-25 13:53:42,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:42,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:53:42,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807880003] [2019-11-25 13:53:42,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:53:42,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:42,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:53:42,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:53:42,652 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-25 13:53:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:42,675 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 13:53:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:53:42,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:53:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:42,677 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:53:42,678 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:53:42,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-25 13:53:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:53:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 13:53:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 13:53:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 13:53:42,685 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-25 13:53:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:42,685 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 13:53:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:53:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 13:53:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:53:42,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:42,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:42,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:53:42,899 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash 211176643, now seen corresponding path program 1 times [2019-11-25 13:53:42,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:42,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632378170] [2019-11-25 13:53:42,900 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-25 13:53:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:43,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 13:53:43,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:43,047 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-25 13:53:43,047 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:43,144 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-25 13:53:43,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632378170] [2019-11-25 13:53:43,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:43,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:53:43,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842887918] [2019-11-25 13:53:43,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:53:43,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:43,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:53:43,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:53:43,146 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2019-11-25 13:53:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:43,235 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-25 13:53:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:53:43,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 13:53:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:43,237 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:53:43,237 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 13:53:43,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-25 13:53:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 13:53:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-25 13:53:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 13:53:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-25 13:53:43,249 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2019-11-25 13:53:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:43,250 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-25 13:53:43,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:53:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-25 13:53:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:53:43,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:43,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:43,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:53:43,470 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash -45428445, now seen corresponding path program 1 times [2019-11-25 13:53:43,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:43,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256285351] [2019-11-25 13:53:43,472 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-25 13:53:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:43,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:53:43,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:43,631 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-25 13:53:43,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:43,681 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-25 13:53:43,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256285351] [2019-11-25 13:53:43,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:43,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:53:43,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80166821] [2019-11-25 13:53:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:53:43,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:43,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:53:43,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:53:43,687 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-25 13:53:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:43,730 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-25 13:53:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:53:43,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 13:53:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:43,733 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:53:43,733 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 13:53:43,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:53:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 13:53:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-25 13:53:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 13:53:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 13:53:43,739 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-11-25 13:53:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:43,740 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 13:53:43,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:53:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 13:53:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:53:43,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:43,741 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:43,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:53:43,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash -792080061, now seen corresponding path program 1 times [2019-11-25 13:53:43,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:43,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120697845] [2019-11-25 13:53:43,955 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-25 13:53:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:44,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:53:44,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:44,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:44,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120697845] [2019-11-25 13:53:44,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:53:44,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 13:53:44,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599082472] [2019-11-25 13:53:44,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:53:44,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:53:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:53:44,274 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-11-25 13:53:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:44,510 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-25 13:53:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:53:44,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 13:53:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:44,521 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:53:44,521 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:53:44,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:53:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:53:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-25 13:53:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 13:53:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-25 13:53:44,527 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2019-11-25 13:53:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:44,527 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-25 13:53:44,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:53:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-25 13:53:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:53:44,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:44,529 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:44,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:53:44,741 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366333, now seen corresponding path program 2 times [2019-11-25 13:53:44,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:44,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905989014] [2019-11-25 13:53:44,743 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-25 13:53:44,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:53:44,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:53:44,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:53:44,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:44,915 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-25 13:53:44,916 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,918 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:44,918 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:53:45,071 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:53:45,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905989014] [2019-11-25 13:53:45,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:45,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:53:45,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868051164] [2019-11-25 13:53:45,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:53:45,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:45,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:53:45,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:53:45,167 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 12 states. [2019-11-25 13:53:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:45,749 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-25 13:53:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:53:45,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 13:53:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:45,751 INFO L225 Difference]: With dead ends: 63 [2019-11-25 13:53:45,751 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 13:53:45,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:53:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 13:53:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-25 13:53:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 13:53:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-25 13:53:45,758 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 38 [2019-11-25 13:53:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:45,758 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-25 13:53:45,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:53:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-25 13:53:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:53:45,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:45,760 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:45,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:53:45,972 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366332, now seen corresponding path program 1 times [2019-11-25 13:53:45,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:45,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391855593] [2019-11-25 13:53:45,974 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-25 13:53:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:46,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:53:46,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:46,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:46,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391855593] [2019-11-25 13:53:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:53:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 13:53:46,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772378916] [2019-11-25 13:53:46,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:53:46,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:53:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:53:46,668 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2019-11-25 13:53:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:47,561 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-25 13:53:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:53:47,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 13:53:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:47,564 INFO L225 Difference]: With dead ends: 75 [2019-11-25 13:53:47,564 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 13:53:47,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 13:53:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 13:53:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-25 13:53:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 13:53:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-25 13:53:47,570 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2019-11-25 13:53:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:47,570 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-25 13:53:47,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:53:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-25 13:53:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 13:53:47,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:47,572 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:47,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:53:47,783 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2064886276, now seen corresponding path program 2 times [2019-11-25 13:53:47,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:47,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441880227] [2019-11-25 13:53:47,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-25 13:53:47,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:53:47,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:53:47,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:53:47,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:47,957 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-25 13:53:47,957 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:47,965 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:47,966 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:47,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:53:48,221 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:53:49,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441880227] [2019-11-25 13:53:49,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:49,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:53:49,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591002861] [2019-11-25 13:53:49,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:53:49,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:53:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:53:49,082 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 23 states. [2019-11-25 13:53:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:50,506 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-25 13:53:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:53:50,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 13:53:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:50,509 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:53:50,509 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 13:53:50,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:53:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 13:53:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 13:53:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 13:53:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-25 13:53:50,514 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 46 [2019-11-25 13:53:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:50,515 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-25 13:53:50,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:53:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-25 13:53:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:53:50,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:50,517 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:50,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:53:50,724 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1743926468, now seen corresponding path program 1 times [2019-11-25 13:53:50,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:50,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698611275] [2019-11-25 13:53:50,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:50,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:53:50,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:51,125 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:51,237 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 13:53:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:52,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698611275] [2019-11-25 13:53:52,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:53:52,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 13:53:52,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928798513] [2019-11-25 13:53:52,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 13:53:52,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 13:53:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:53:52,144 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-11-25 13:53:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:53,004 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-25 13:53:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 13:53:53,005 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 13:53:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:53,005 INFO L225 Difference]: With dead ends: 76 [2019-11-25 13:53:53,006 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 13:53:53,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-25 13:53:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 13:53:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-25 13:53:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 13:53:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-11-25 13:53:53,011 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 51 [2019-11-25 13:53:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:53,011 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-11-25 13:53:53,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 13:53:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-11-25 13:53:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:53:53,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:53,021 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:53,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:53:53,236 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 845780764, now seen corresponding path program 2 times [2019-11-25 13:53:53,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:53,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134832761] [2019-11-25 13:53:53,239 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:53,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:53:53,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:53:53,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:53:53,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:53,392 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-25 13:53:53,393 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:53,394 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:53,394 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:53,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:53,558 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:53,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134832761] [2019-11-25 13:53:53,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:53,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:53:53,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533869087] [2019-11-25 13:53:53,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:53:53,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:53,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:53:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:53:53,630 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 12 states. [2019-11-25 13:53:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:54,126 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-25 13:53:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:53:54,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-25 13:53:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:54,128 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:53:54,128 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 13:53:54,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:53:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 13:53:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 13:53:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 13:53:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-25 13:53:54,133 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2019-11-25 13:53:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:54,133 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-25 13:53:54,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:53:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-25 13:53:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:53:54,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:54,135 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:54,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:53:54,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 845780765, now seen corresponding path program 1 times [2019-11-25 13:53:54,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:54,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459029402] [2019-11-25 13:53:54,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:54,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:53:54,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:54,578 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-25 13:53:54,578 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:54,583 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:54,584 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:54,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:54,889 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:55,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459029402] [2019-11-25 13:53:55,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:55,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:53:55,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650019856] [2019-11-25 13:53:55,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:53:55,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:53:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:53:55,698 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2019-11-25 13:53:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:57,101 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-25 13:53:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:53:57,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-25 13:53:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:57,103 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:53:57,104 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 13:53:57,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:53:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 13:53:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 13:53:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 13:53:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-25 13:53:57,111 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2019-11-25 13:53:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:57,111 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-25 13:53:57,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:53:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-25 13:53:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:53:57,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:57,116 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:57,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:53:57,327 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1516815243, now seen corresponding path program 1 times [2019-11-25 13:53:57,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:57,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227909715] [2019-11-25 13:53:57,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:57,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:53:57,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:57,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:57,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227909715] [2019-11-25 13:53:57,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:57,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:53:57,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344173435] [2019-11-25 13:53:57,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:53:57,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:57,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:53:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:53:57,761 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-11-25 13:53:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:57,829 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-25 13:53:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:53:57,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-25 13:53:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:57,831 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:53:57,831 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 13:53:57,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:53:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 13:53:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 13:53:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 13:53:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-25 13:53:57,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2019-11-25 13:53:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:57,839 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-25 13:53:57,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:53:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-25 13:53:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 13:53:57,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:57,847 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:58,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:53:58,060 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 240473020, now seen corresponding path program 1 times [2019-11-25 13:53:58,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:58,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958982659] [2019-11-25 13:53:58,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:58,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:53:58,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:58,289 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:58,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:58,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958982659] [2019-11-25 13:53:58,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:58,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 13:53:58,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162652182] [2019-11-25 13:53:58,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:53:58,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:53:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:53:58,647 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2019-11-25 13:53:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:58,753 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-25 13:53:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:53:58,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-25 13:53:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:58,755 INFO L225 Difference]: With dead ends: 72 [2019-11-25 13:53:58,755 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 13:53:58,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:53:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 13:53:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 13:53:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 13:53:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-11-25 13:53:58,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 56 [2019-11-25 13:53:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:58,759 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-11-25 13:53:58,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:53:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-11-25 13:53:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 13:53:58,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:58,761 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:58,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:53:58,963 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash 214334517, now seen corresponding path program 1 times [2019-11-25 13:53:58,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:58,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462590766] [2019-11-25 13:53:58,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:59,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-25 13:53:59,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:59,371 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 14 treesize of output 10 [2019-11-25 13:53:59,371 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,378 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:59,379 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-25 13:53:59,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:59,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-25 13:53:59,442 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,479 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-25 13:53:59,480 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-25 13:53:59,612 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-25 13:53:59,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-25 13:53:59,613 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,633 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:59,634 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-25 13:53:59,818 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 13:53:59,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-25 13:53:59,820 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,843 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:59,843 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:59,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 13:54:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:54:00,574 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:00,982 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:54:01,748 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:54:03,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,879 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:54:05,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:54:05,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:54:06,101 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 13:54:06,102 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 13:54:06,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-25 13:54:06,111 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 13:54:06,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 23 [2019-11-25 13:54:06,112 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:06,113 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:06,113 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:06,114 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:06,114 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-25 13:54:06,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 13:54:07,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:54:07,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:54:08,234 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 13:54:08,235 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 13:54:08,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-25 13:54:08,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,565 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 13:54:08,567 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 13:54:08,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-25 13:54:08,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:08,577 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:08,754 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-11-25 13:54:08,755 INFO L588 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2019-11-25 13:54:08,755 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:08,815 INFO L588 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-25 13:54:08,816 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:08,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-25 13:54:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:54:10,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462590766] [2019-11-25 13:54:10,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:54:10,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-25 13:54:10,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630256617] [2019-11-25 13:54:10,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-25 13:54:10,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-25 13:54:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 13:54:10,263 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 55 states. [2019-11-25 13:54:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:15,849 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-25 13:54:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-25 13:54:15,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2019-11-25 13:54:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:15,851 INFO L225 Difference]: With dead ends: 60 [2019-11-25 13:54:15,851 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:54:15,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-25 13:54:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:54:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:54:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:54:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:54:15,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-25 13:54:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:15,854 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:54:15,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-25 13:54:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:54:15,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:54:16,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:54:16,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:54:16 BoogieIcfgContainer [2019-11-25 13:54:16,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:54:16,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:54:16,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:54:16,071 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:54:16,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:53:39" (3/4) ... [2019-11-25 13:54:16,075 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 13:54:16,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 13:54:16,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 13:54:16,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 13:54:16,084 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 13:54:16,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 13:54:16,091 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-25 13:54:16,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 13:54:16,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:54:16,093 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:54:16,093 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:54:16,135 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:54:16,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:54:16,136 INFO L168 Benchmark]: Toolchain (without parser) took 39094.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 443.5 MB). Free memory was 956.3 MB in the beginning and 1.4 GB in the end (delta: -444.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:16,137 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:16,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:16,138 INFO L168 Benchmark]: Boogie Preprocessor took 99.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:16,138 INFO L168 Benchmark]: RCFGBuilder took 1451.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.5 MB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:16,138 INFO L168 Benchmark]: TraceAbstraction took 36594.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 968.5 MB in the beginning and 1.4 GB in the end (delta: -445.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:16,139 INFO L168 Benchmark]: Witness Printer took 64.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:16,140 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 879.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1451.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.5 MB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36594.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 968.5 MB in the beginning and 1.4 GB in the end (delta: -445.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 64.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 330 locations, 71 error locations. Result: SAFE, OverallTime: 36.5s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 792 SDtfs, 441 SDslu, 5182 SDs, 0 SdLazy, 3843 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 985 SyntacticMatches, 19 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 614 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1196 ConstructedInterpolants, 80 QuantifiedInterpolants, 271329 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1340/1870 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...