./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version de1bb103 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_4.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 e9fb52f5a8769e751d5dc39d93dc642433ae2f5b ............................................................................................................................ 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_4.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 e9fb52f5a8769e751d5dc39d93dc642433ae2f5b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:24:23,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:24:23,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:24:23,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:24:23,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:24:23,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:24:23,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:24:23,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:24:23,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:24:23,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:24:23,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:24:23,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:24:23,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:24:23,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:24:23,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:24:23,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:24:23,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:24:23,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:24:23,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:24:23,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:24:23,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:24:23,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:24:23,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:24:23,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:24:23,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:24:23,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:24:23,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:24:23,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:24:23,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:24:23,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:24:23,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:24:23,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:24:23,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:24:23,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:24:23,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:24:23,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:24:23,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:24:23,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:24:23,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:24:23,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:24:23,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:24:23,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 13:24:24,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:24:24,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:24:24,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:24:24,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:24:24,007 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:24:24,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:24:24,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:24:24,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:24:24,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:24:24,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:24:24,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:24:24,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:24:24,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:24:24,009 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:24:24,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:24:24,011 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:24:24,011 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:24:24,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:24:24,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:24:24,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:24:24,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:24:24,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:24:24,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:24:24,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:24:24,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:24:24,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 13:24:24,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 13:24:24,014 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 -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-27 13:24:24,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:24:24,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:24:24,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:24:24,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:24:24,339 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:24:24,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 13:24:24,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5b0313e/0ba58ce23b4e4dd99ed410bc3a274949/FLAG0fa3349af [2019-11-27 13:24:24,968 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:24:24,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 13:24:24,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5b0313e/0ba58ce23b4e4dd99ed410bc3a274949/FLAG0fa3349af [2019-11-27 13:24:25,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5b0313e/0ba58ce23b4e4dd99ed410bc3a274949 [2019-11-27 13:24:25,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:24:25,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:24:25,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:25,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:24:25,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:24:25,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:25" (1/1) ... [2019-11-27 13:24:25,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8d684c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:25, skipping insertion in model container [2019-11-27 13:24:25,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:25" (1/1) ... [2019-11-27 13:24:25,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:24:25,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:25,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:25,859 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-27 13:24:25,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7651be6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:25, skipping insertion in model container [2019-11-27 13:24:25,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:25,860 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 13:24:25,863 INFO L168 Benchmark]: Toolchain (without parser) took 587.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 13:24:25,864 INFO L168 Benchmark]: CDTParser took 0.31 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-27 13:24:25,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 13:24:25,867 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.31 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 583.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:24:27,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:24:27,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:24:27,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:24:27,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:24:27,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:24:27,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:24:27,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:24:27,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:24:27,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:24:27,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:24:27,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:24:27,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:24:27,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:24:27,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:24:27,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:24:27,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:24:27,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:24:27,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:24:27,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:24:27,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:24:27,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:24:27,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:24:27,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:24:27,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:24:27,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:24:27,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:24:27,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:24:27,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:24:27,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:24:27,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:24:27,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:24:27,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:24:27,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:24:27,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:24:27,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:24:27,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:24:27,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:24:27,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:24:27,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:24:27,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:24:27,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 13:24:27,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:24:27,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:24:27,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:24:27,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:24:27,810 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:24:27,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:24:27,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:24:27,811 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:24:27,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:24:27,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:24:27,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:24:27,812 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:24:27,812 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:24:27,812 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:24:27,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:24:27,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:24:27,813 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 13:24:27,813 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 13:24:27,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:24:27,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:24:27,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:24:27,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:24:27,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:24:27,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:24:27,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:24:27,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:24:27,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:24:27,815 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 13:24:27,815 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 13:24:27,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 13:24:27,816 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 -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-27 13:24:28,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:24:28,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:24:28,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:24:28,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:24:28,166 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:24:28,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 13:24:28,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b014a85e/905a49fbc13a403b88d8c589c88f72b7/FLAGa2598b578 [2019-11-27 13:24:28,813 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:24:28,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 13:24:28,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b014a85e/905a49fbc13a403b88d8c589c88f72b7/FLAGa2598b578 [2019-11-27 13:24:29,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b014a85e/905a49fbc13a403b88d8c589c88f72b7 [2019-11-27 13:24:29,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:24:29,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:24:29,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:29,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:24:29,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:24:29,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:29,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502e7484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29, skipping insertion in model container [2019-11-27 13:24:29,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:29,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:24:29,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:29,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:29,704 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 13:24:29,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:29,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:29,785 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 13:24:29,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:29,944 INFO L208 MainTranslator]: Completed translation [2019-11-27 13:24:29,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29 WrapperNode [2019-11-27 13:24:29,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:29,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 13:24:29,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 13:24:29,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 13:24:29,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:29,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:29,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:29,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:30,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:30,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:30,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... [2019-11-27 13:24:30,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 13:24:30,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 13:24:30,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 13:24:30,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 13:24:30,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:24:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 13:24:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 13:24:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:24:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:24:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 13:24:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 13:24:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 13:24:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 13:24:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 13:24:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 13:24:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 13:24:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 13:24:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 13:24:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 13:24:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 13:24:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 13:24:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 13:24:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 13:24:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 13:24:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 13:24:30,128 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 13:24:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 13:24:30,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 13:24:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 13:24:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 13:24:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 13:24:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 13:24:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 13:24:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 13:24:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 13:24:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 13:24:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 13:24:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 13:24:30,140 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 13:24:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 13:24:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 13:24:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 13:24:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 13:24:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 13:24:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 13:24:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 13:24:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 13:24:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 13:24:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 13:24:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 13:24:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 13:24:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 13:24:30,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 13:24:30,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 13:24:30,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 13:24:30,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 13:24:30,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-27 13:24:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-27 13:24:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 13:24:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 13:24:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 13:24:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 13:24:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 13:24:30,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 13:24:30,894 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 13:24:31,269 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 13:24:31,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 13:24:31,653 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 13:24:31,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:31 BoogieIcfgContainer [2019-11-27 13:24:31,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 13:24:31,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 13:24:31,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 13:24:31,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 13:24:31,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 01:24:29" (1/3) ... [2019-11-27 13:24:31,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413304a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:24:31, skipping insertion in model container [2019-11-27 13:24:31,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29" (2/3) ... [2019-11-27 13:24:31,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413304a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:24:31, skipping insertion in model container [2019-11-27 13:24:31,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:31" (3/3) ... [2019-11-27 13:24:31,666 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2019-11-27 13:24:31,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 13:24:31,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 13:24:31,700 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 13:24:31,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 13:24:31,720 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 13:24:31,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 13:24:31,720 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 13:24:31,720 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 13:24:31,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 13:24:31,721 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 13:24:31,721 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 13:24:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-11-27 13:24:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:31,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:31,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:31,755 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-27 13:24:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-27 13:24:31,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:31,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912958399] [2019-11-27 13:24:31,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:31,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:31,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:32,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:32,060 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:32,069 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:32,069 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:32,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:32,102 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:32,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912958399] [2019-11-27 13:24:32,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:32,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 13:24:32,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385268394] [2019-11-27 13:24:32,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:32,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:32,208 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 5 states. [2019-11-27 13:24:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:32,628 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-27 13:24:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:32,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 13:24:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:32,647 INFO L225 Difference]: With dead ends: 160 [2019-11-27 13:24:32,647 INFO L226 Difference]: Without dead ends: 157 [2019-11-27 13:24:32,649 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-27 13:24:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-27 13:24:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2019-11-27 13:24:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-27 13:24:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2019-11-27 13:24:32,713 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 17 [2019-11-27 13:24:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:32,713 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2019-11-27 13:24:32,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2019-11-27 13:24:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:32,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:32,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:32,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 13:24:32,916 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-27 13:24:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-27 13:24:32,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:32,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977598327] [2019-11-27 13:24:32,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:33,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 13:24:33,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:33,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:33,081 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:33,089 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:33,090 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:33,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:33,145 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:33,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977598327] [2019-11-27 13:24:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:33,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 13:24:33,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190452932] [2019-11-27 13:24:33,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:24:33,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:24:33,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:24:33,524 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 10 states. [2019-11-27 13:24:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:34,294 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-27 13:24:34,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:24:34,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 13:24:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:34,300 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:24:34,301 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 13:24:34,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:24:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 13:24:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-11-27 13:24:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-27 13:24:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2019-11-27 13:24:34,316 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 17 [2019-11-27 13:24:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:34,317 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2019-11-27 13:24:34,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:24:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2019-11-27 13:24:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:34,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:34,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:34,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 13:24:34,532 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-27 13:24:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-27 13:24:34,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:34,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048589119] [2019-11-27 13:24:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:34,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 13:24:34,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:34,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:34,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048589119] [2019-11-27 13:24:34,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:34,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 13:24:34,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053086715] [2019-11-27 13:24:34,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:34,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:34,721 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 5 states. [2019-11-27 13:24:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:34,753 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-11-27 13:24:34,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:34,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 13:24:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:34,755 INFO L225 Difference]: With dead ends: 150 [2019-11-27 13:24:34,756 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 13:24:34,756 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-27 13:24:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 13:24:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-27 13:24:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 13:24:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-27 13:24:34,768 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 17 [2019-11-27 13:24:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:34,768 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-27 13:24:34,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-27 13:24:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 13:24:34,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:34,770 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] [2019-11-27 13:24:34,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 13:24:34,981 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-27 13:24:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 300911328, now seen corresponding path program 1 times [2019-11-27 13:24:34,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:34,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819280994] [2019-11-27 13:24:34,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:35,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:35,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:35,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:35,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819280994] [2019-11-27 13:24:35,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:35,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 13:24:35,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850623904] [2019-11-27 13:24:35,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:35,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:35,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:35,241 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 5 states. [2019-11-27 13:24:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:35,270 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2019-11-27 13:24:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:35,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 13:24:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:35,275 INFO L225 Difference]: With dead ends: 150 [2019-11-27 13:24:35,275 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 13:24:35,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 13:24:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-27 13:24:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 13:24:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2019-11-27 13:24:35,300 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 29 [2019-11-27 13:24:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:35,301 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2019-11-27 13:24:35,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2019-11-27 13:24:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 13:24:35,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:35,302 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] [2019-11-27 13:24:35,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 13:24:35,504 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-27 13:24:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash -696161025, now seen corresponding path program 1 times [2019-11-27 13:24:35,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:35,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959621754] [2019-11-27 13:24:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:35,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 13:24:35,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:35,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:35,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959621754] [2019-11-27 13:24:35,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:35,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 13:24:35,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436116948] [2019-11-27 13:24:35,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 13:24:35,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 13:24:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:24:35,803 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 9 states. [2019-11-27 13:24:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:35,929 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2019-11-27 13:24:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:24:35,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-27 13:24:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:35,931 INFO L225 Difference]: With dead ends: 168 [2019-11-27 13:24:35,932 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 13:24:35,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:24:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 13:24:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2019-11-27 13:24:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-27 13:24:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2019-11-27 13:24:35,957 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 29 [2019-11-27 13:24:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:35,957 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2019-11-27 13:24:35,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 13:24:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2019-11-27 13:24:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 13:24:35,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:35,961 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-27 13:24:36,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 13:24:36,162 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-27 13:24:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-27 13:24:36,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:36,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108031892] [2019-11-27 13:24:36,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:36,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 13:24:36,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:36,319 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:36,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108031892] [2019-11-27 13:24:36,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:36,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 13:24:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660789910] [2019-11-27 13:24:36,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:24:36,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:24:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:24:36,376 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 6 states. [2019-11-27 13:24:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:36,423 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2019-11-27 13:24:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:24:36,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 13:24:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:36,426 INFO L225 Difference]: With dead ends: 168 [2019-11-27 13:24:36,426 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 13:24:36,427 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-27 13:24:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 13:24:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-27 13:24:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-27 13:24:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2019-11-27 13:24:36,435 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 32 [2019-11-27 13:24:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:36,436 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2019-11-27 13:24:36,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:24:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2019-11-27 13:24:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 13:24:36,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:36,438 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-27 13:24:36,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 13:24:36,652 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-27 13:24:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:36,653 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-27 13:24:36,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:36,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285730103] [2019-11-27 13:24:36,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:36,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:36,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:36,877 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-27 13:24:36,878 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:36,992 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-27 13:24:36,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285730103] [2019-11-27 13:24:36,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:36,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 13:24:36,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596083860] [2019-11-27 13:24:36,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:24:36,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:24:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:24:36,995 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 10 states. [2019-11-27 13:24:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:37,226 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-11-27 13:24:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:24:37,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 13:24:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:37,231 INFO L225 Difference]: With dead ends: 172 [2019-11-27 13:24:37,231 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 13:24:37,232 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-27 13:24:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 13:24:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-27 13:24:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-27 13:24:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2019-11-27 13:24:37,250 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 34 [2019-11-27 13:24:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:37,251 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2019-11-27 13:24:37,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:24:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2019-11-27 13:24:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:24:37,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:37,256 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-27 13:24:37,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 13:24:37,457 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-27 13:24:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-27 13:24:37,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:37,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299293357] [2019-11-27 13:24:37,459 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-27 13:24:37,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:37,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:37,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:24:37,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:37,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:37,638 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:37,644 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:37,645 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:37,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:37,837 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-27 13:24:37,837 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:37,951 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-27 13:24:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299293357] [2019-11-27 13:24:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 13:24:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949394258] [2019-11-27 13:24:37,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 13:24:37,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 13:24:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 13:24:37,953 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 12 states. [2019-11-27 13:24:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:39,057 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2019-11-27 13:24:39,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:24:39,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 13:24:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:39,059 INFO L225 Difference]: With dead ends: 179 [2019-11-27 13:24:39,059 INFO L226 Difference]: Without dead ends: 179 [2019-11-27 13:24:39,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 13:24:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-27 13:24:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-11-27 13:24:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-27 13:24:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2019-11-27 13:24:39,066 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 38 [2019-11-27 13:24:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:39,067 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2019-11-27 13:24:39,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 13:24:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2019-11-27 13:24:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:24:39,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:39,068 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-27 13:24:39,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 13:24:39,280 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-27 13:24:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-27 13:24:39,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:39,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061447639] [2019-11-27 13:24:39,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:39,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 13:24:39,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:39,544 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-27 13:24:39,544 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:39,960 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-27 13:24:39,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061447639] [2019-11-27 13:24:39,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:39,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 13:24:39,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048988057] [2019-11-27 13:24:39,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 13:24:39,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 13:24:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 13:24:39,963 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand 18 states. [2019-11-27 13:24:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:40,884 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-11-27 13:24:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 13:24:40,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 13:24:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:40,889 INFO L225 Difference]: With dead ends: 179 [2019-11-27 13:24:40,889 INFO L226 Difference]: Without dead ends: 175 [2019-11-27 13:24:40,890 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-27 13:24:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-27 13:24:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-27 13:24:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-27 13:24:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2019-11-27 13:24:40,900 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 38 [2019-11-27 13:24:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:40,901 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2019-11-27 13:24:40,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 13:24:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2019-11-27 13:24:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 13:24:40,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:40,907 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:41,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 13:24:41,112 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-27 13:24:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1347385061, now seen corresponding path program 1 times [2019-11-27 13:24:41,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579103075] [2019-11-27 13:24:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:41,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 13:24:41,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:41,328 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:41,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579103075] [2019-11-27 13:24:41,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:41,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 13:24:41,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928955918] [2019-11-27 13:24:41,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 13:24:41,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 13:24:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:24:41,389 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 7 states. [2019-11-27 13:24:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:41,438 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-11-27 13:24:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 13:24:41,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-27 13:24:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:41,440 INFO L225 Difference]: With dead ends: 184 [2019-11-27 13:24:41,440 INFO L226 Difference]: Without dead ends: 184 [2019-11-27 13:24:41,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 13:24:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-27 13:24:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-11-27 13:24:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-27 13:24:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2019-11-27 13:24:41,448 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 40 [2019-11-27 13:24:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:41,449 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2019-11-27 13:24:41,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 13:24:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2019-11-27 13:24:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:24:41,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:41,450 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, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:41,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 13:24:41,666 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-27 13:24:41,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1156201438, now seen corresponding path program 1 times [2019-11-27 13:24:41,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:41,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144170984] [2019-11-27 13:24:41,668 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-27 13:24:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:41,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 13:24:41,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:41,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:41,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144170984] [2019-11-27 13:24:41,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:41,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 13:24:41,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272688516] [2019-11-27 13:24:41,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 13:24:41,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 13:24:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:24:41,960 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 3 states. [2019-11-27 13:24:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:42,161 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-11-27 13:24:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 13:24:42,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-27 13:24:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:42,164 INFO L225 Difference]: With dead ends: 191 [2019-11-27 13:24:42,164 INFO L226 Difference]: Without dead ends: 165 [2019-11-27 13:24:42,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:24:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-27 13:24:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-27 13:24:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 13:24:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2019-11-27 13:24:42,170 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 38 [2019-11-27 13:24:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:42,170 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2019-11-27 13:24:42,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 13:24:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2019-11-27 13:24:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 13:24:42,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:42,171 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-27 13:24:42,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 13:24:42,379 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-27 13:24:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-27 13:24:42,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:42,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930567649] [2019-11-27 13:24:42,380 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-27 13:24:42,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:42,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:42,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 13:24:42,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:42,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:42,563 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:42,571 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:42,571 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:42,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:42,849 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-27 13:24:42,850 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:43,844 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-27 13:24:43,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930567649] [2019-11-27 13:24:43,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:43,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 13:24:43,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467198366] [2019-11-27 13:24:43,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 13:24:43,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 13:24:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 13:24:43,846 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 23 states. [2019-11-27 13:24:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:46,810 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2019-11-27 13:24:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 13:24:46,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 13:24:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:46,812 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:24:46,812 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 13:24:46,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-27 13:24:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 13:24:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-27 13:24:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 13:24:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-27 13:24:46,818 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 46 [2019-11-27 13:24:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:46,819 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-27 13:24:46,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 13:24:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-27 13:24:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 13:24:46,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:46,820 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-27 13:24:47,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 13:24:47,030 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-27 13:24:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-27 13:24:47,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:47,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897929446] [2019-11-27 13:24:47,031 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-27 13:24:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:47,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 13:24:47,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:47,407 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-27 13:24:47,407 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:47,531 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 13:24:48,388 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-27 13:24:48,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897929446] [2019-11-27 13:24:48,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:48,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 13:24:48,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53269491] [2019-11-27 13:24:48,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 13:24:48,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 13:24:48,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 13:24:48,391 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 34 states. [2019-11-27 13:24:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:49,197 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-27 13:24:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 13:24:49,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 13:24:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:49,200 INFO L225 Difference]: With dead ends: 162 [2019-11-27 13:24:49,200 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 13:24:49,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 13:24:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 13:24:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-27 13:24:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-27 13:24:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2019-11-27 13:24:49,205 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 51 [2019-11-27 13:24:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:49,206 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2019-11-27 13:24:49,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 13:24:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2019-11-27 13:24:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 13:24:49,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:49,207 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-27 13:24:49,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 13:24:49,419 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-27 13:24:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-27 13:24:49,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:49,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061687756] [2019-11-27 13:24:49,428 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 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-27 13:24:49,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:49,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:24:49,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:49,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:49,587 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:49,588 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:49,589 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:49,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:49,771 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-27 13:24:49,771 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:49,851 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-27 13:24:49,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061687756] [2019-11-27 13:24:49,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:49,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 13:24:49,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394702923] [2019-11-27 13:24:49,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 13:24:49,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 13:24:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 13:24:49,853 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 12 states. [2019-11-27 13:24:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:50,820 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-11-27 13:24:50,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:24:50,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 13:24:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:50,823 INFO L225 Difference]: With dead ends: 168 [2019-11-27 13:24:50,823 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 13:24:50,823 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-27 13:24:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 13:24:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2019-11-27 13:24:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 13:24:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-27 13:24:50,828 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 53 [2019-11-27 13:24:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:50,829 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-27 13:24:50,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 13:24:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-27 13:24:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 13:24:50,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:50,830 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-27 13:24:51,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 13:24:51,041 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-27 13:24:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-27 13:24:51,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:51,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457639297] [2019-11-27 13:24:51,044 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-27 13:24:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:51,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 13:24:51,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:51,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:51,305 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:51,313 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:51,313 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:51,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:51,554 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-27 13:24:51,555 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:52,420 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-27 13:24:52,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457639297] [2019-11-27 13:24:52,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:52,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 13:24:52,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582594264] [2019-11-27 13:24:52,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 13:24:52,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 13:24:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 13:24:52,422 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 23 states. [2019-11-27 13:24:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:55,633 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2019-11-27 13:24:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 13:24:55,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 13:24:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:55,635 INFO L225 Difference]: With dead ends: 154 [2019-11-27 13:24:55,635 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 13:24:55,636 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-27 13:24:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 13:24:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 13:24:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 13:24:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-27 13:24:55,641 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 53 [2019-11-27 13:24:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:55,642 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-27 13:24:55,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 13:24:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-27 13:24:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-27 13:24:55,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:55,643 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] [2019-11-27 13:24:55,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 13:24:55,854 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-27 13:24:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011139, now seen corresponding path program 1 times [2019-11-27 13:24:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:55,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681370340] [2019-11-27 13:24:55,857 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-27 13:24:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:56,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 13:24:56,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:56,072 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-27 13:24:56,072 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:56,202 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-27 13:24:56,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681370340] [2019-11-27 13:24:56,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:56,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 13:24:56,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077858353] [2019-11-27 13:24:56,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 13:24:56,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 13:24:56,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 13:24:56,204 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2019-11-27 13:24:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:56,261 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-11-27 13:24:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 13:24:56,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-27 13:24:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:56,265 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:24:56,265 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 13:24:56,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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-27 13:24:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 13:24:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 13:24:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 13:24:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2019-11-27 13:24:56,271 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 58 [2019-11-27 13:24:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:56,271 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2019-11-27 13:24:56,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 13:24:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2019-11-27 13:24:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-27 13:24:56,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:56,272 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] [2019-11-27 13:24:56,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 13:24:56,478 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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-27 13:24:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1283825080, now seen corresponding path program 1 times [2019-11-27 13:24:56,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:56,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929347296] [2019-11-27 13:24:56,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:56,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 13:24:56,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:56,749 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-27 13:24:56,749 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:56,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:24:56,988 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-27 13:24:56,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929347296] [2019-11-27 13:24:56,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:56,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 13:24:56,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017831851] [2019-11-27 13:24:56,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 13:24:56,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 13:24:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:24:56,990 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 11 states. [2019-11-27 13:24:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:57,099 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-27 13:24:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:24:57,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-27 13:24:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:57,103 INFO L225 Difference]: With dead ends: 158 [2019-11-27 13:24:57,103 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 13:24:57,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-27 13:24:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 13:24:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 13:24:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 13:24:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2019-11-27 13:24:57,120 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 63 [2019-11-27 13:24:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:57,121 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2019-11-27 13:24:57,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 13:24:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2019-11-27 13:24:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 13:24:57,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:57,122 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:57,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 13:24:57,337 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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-27 13:24:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000591, now seen corresponding path program 1 times [2019-11-27 13:24:57,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:57,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325764309] [2019-11-27 13:24:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:57,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 13:24:57,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:57,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:24:57,615 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:57,617 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:57,617 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:57,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:57,842 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-27 13:24:57,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:58,039 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-27 13:24:58,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325764309] [2019-11-27 13:24:58,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:58,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 13:24:58,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922604075] [2019-11-27 13:24:58,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 13:24:58,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 13:24:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 13:24:58,041 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 17 states. [2019-11-27 13:24:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:59,582 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2019-11-27 13:24:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 13:24:59,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-27 13:24:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:59,585 INFO L225 Difference]: With dead ends: 164 [2019-11-27 13:24:59,585 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 13:24:59,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 13:24:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 13:24:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-27 13:24:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 13:24:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-11-27 13:24:59,599 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 74 [2019-11-27 13:24:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:59,601 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-11-27 13:24:59,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 13:24:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-11-27 13:24:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 13:24:59,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:59,607 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:59,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 13:24:59,822 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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-27 13:24:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000592, now seen corresponding path program 1 times [2019-11-27 13:24:59,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:59,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379921073] [2019-11-27 13:24:59,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:00,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 13:25:00,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:00,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:25:00,177 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:00,186 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:00,186 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:00,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:25:00,773 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-27 13:25:00,773 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:02,692 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-27 13:25:02,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379921073] [2019-11-27 13:25:02,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:02,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 13:25:02,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140658339] [2019-11-27 13:25:02,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 13:25:02,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 13:25:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 13:25:02,695 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 33 states. [2019-11-27 13:25:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:07,424 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-11-27 13:25:07,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 13:25:07,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-27 13:25:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:07,426 INFO L225 Difference]: With dead ends: 150 [2019-11-27 13:25:07,426 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 13:25:07,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 13:25:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 13:25:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 13:25:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 13:25:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-27 13:25:07,431 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 74 [2019-11-27 13:25:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:07,432 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-27 13:25:07,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 13:25:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-27 13:25:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-27 13:25:07,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:07,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:25:07,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 13:25:07,645 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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-27 13:25:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1519816277, now seen corresponding path program 1 times [2019-11-27 13:25:07,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:07,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585708851] [2019-11-27 13:25:07,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:07,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:25:07,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:07,981 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-27 13:25:07,981 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:08,225 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-27 13:25:08,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585708851] [2019-11-27 13:25:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:08,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-27 13:25:08,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73723552] [2019-11-27 13:25:08,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 13:25:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 13:25:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-27 13:25:08,229 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 14 states. [2019-11-27 13:25:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:08,369 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2019-11-27 13:25:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:25:08,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-11-27 13:25:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:08,371 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:25:08,371 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 13:25:08,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-27 13:25:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 13:25:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 13:25:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 13:25:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2019-11-27 13:25:08,374 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 85 [2019-11-27 13:25:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2019-11-27 13:25:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 13:25:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2019-11-27 13:25:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 13:25:08,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:08,376 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, 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-27 13:25:08,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 13:25:08,586 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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-27 13:25:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797402, now seen corresponding path program 1 times [2019-11-27 13:25:08,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:08,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701564588] [2019-11-27 13:25:08,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:08,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 13:25:08,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:08,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:25:08,880 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:08,882 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:08,882 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:08,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:25:09,279 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-27 13:25:09,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:09,499 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-27 13:25:09,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701564588] [2019-11-27 13:25:09,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:09,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 13:25:09,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188931344] [2019-11-27 13:25:09,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 13:25:09,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 13:25:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 13:25:09,502 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 17 states. [2019-11-27 13:25:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:10,899 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2019-11-27 13:25:10,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 13:25:10,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-11-27 13:25:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:10,900 INFO L225 Difference]: With dead ends: 164 [2019-11-27 13:25:10,901 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 13:25:10,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 13:25:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 13:25:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2019-11-27 13:25:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 13:25:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-11-27 13:25:10,907 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 98 [2019-11-27 13:25:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:10,908 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-11-27 13:25:10,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 13:25:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-11-27 13:25:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 13:25:10,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:10,910 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, 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-27 13:25:11,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 13:25:11,124 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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-27 13:25:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797403, now seen corresponding path program 1 times [2019-11-27 13:25:11,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:11,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317265704] [2019-11-27 13:25:11,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:11,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 13:25:11,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:11,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:25:11,423 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:11,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:11,432 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:11,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:25:11,874 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-27 13:25:11,875 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:13,686 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-27 13:25:13,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317265704] [2019-11-27 13:25:13,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:13,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 13:25:13,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390241150] [2019-11-27 13:25:13,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 13:25:13,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 13:25:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 13:25:13,688 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 33 states. [2019-11-27 13:25:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:17,958 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2019-11-27 13:25:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 13:25:17,961 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2019-11-27 13:25:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:17,962 INFO L225 Difference]: With dead ends: 146 [2019-11-27 13:25:17,962 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 13:25:17,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 13:25:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 13:25:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 13:25:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 13:25:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-27 13:25:17,968 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 98 [2019-11-27 13:25:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:17,968 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-27 13:25:17,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 13:25:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-27 13:25:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 13:25:17,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:17,970 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, 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-27 13:25:18,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 13:25:18,180 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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-27 13:25:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash -797927977, now seen corresponding path program 1 times [2019-11-27 13:25:18,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:18,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171466625] [2019-11-27 13:25:18,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:18,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 13:25:18,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:18,519 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-27 13:25:18,519 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:18,826 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-27 13:25:18,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171466625] [2019-11-27 13:25:18,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-27 13:25:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32591778] [2019-11-27 13:25:18,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 13:25:18,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 13:25:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:25:18,828 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 11 states. [2019-11-27 13:25:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:18,916 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-11-27 13:25:18,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:25:18,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-11-27 13:25:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:18,917 INFO L225 Difference]: With dead ends: 148 [2019-11-27 13:25:18,918 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 13:25:18,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-27 13:25:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 13:25:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 13:25:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 13:25:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-11-27 13:25:18,922 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 96 [2019-11-27 13:25:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:18,923 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-11-27 13:25:18,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 13:25:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-11-27 13:25:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 13:25:18,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:18,924 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, 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-27 13:25:19,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 13:25:19,125 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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-27 13:25:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash 693754465, now seen corresponding path program 1 times [2019-11-27 13:25:19,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:19,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976701228] [2019-11-27 13:25:19,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:19,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 13:25:19,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:19,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:25:19,536 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:19,538 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:19,538 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:19,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:25:20,059 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-27 13:25:20,060 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:20,351 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-27 13:25:20,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976701228] [2019-11-27 13:25:20,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:20,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-27 13:25:20,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416287773] [2019-11-27 13:25:20,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 13:25:20,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 13:25:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-27 13:25:20,353 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 21 states. [2019-11-27 13:25:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:22,069 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2019-11-27 13:25:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 13:25:22,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-11-27 13:25:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:22,071 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:25:22,071 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 13:25:22,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-27 13:25:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 13:25:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2019-11-27 13:25:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 13:25:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-11-27 13:25:22,079 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 111 [2019-11-27 13:25:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:22,080 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-11-27 13:25:22,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 13:25:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-11-27 13:25:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 13:25:22,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:22,082 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, 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-27 13:25:22,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-27 13:25:22,293 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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-27 13:25:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 693754466, now seen corresponding path program 1 times [2019-11-27 13:25:22,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:22,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89150607] [2019-11-27 13:25:22,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:22,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-27 13:25:22,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:22,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 13:25:22,667 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:22,673 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:22,673 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:22,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:25:23,278 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-27 13:25:23,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:25,902 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-27 13:25:25,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89150607] [2019-11-27 13:25:25,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:25,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-27 13:25:25,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069809202] [2019-11-27 13:25:25,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-27 13:25:25,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-27 13:25:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 13:25:25,905 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 41 states. [2019-11-27 13:25:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:31,546 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-11-27 13:25:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 13:25:31,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2019-11-27 13:25:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:31,548 INFO L225 Difference]: With dead ends: 142 [2019-11-27 13:25:31,548 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 13:25:31,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-27 13:25:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 13:25:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-27 13:25:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-27 13:25:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-27 13:25:31,554 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 111 [2019-11-27 13:25:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:31,555 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-27 13:25:31,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-27 13:25:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-27 13:25:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-27 13:25:31,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:31,556 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, 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-27 13:25:31,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-27 13:25:31,758 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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-27 13:25:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 256905644, now seen corresponding path program 1 times [2019-11-27 13:25:31,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:31,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155049886] [2019-11-27 13:25:31,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:32,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 13:25:32,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:33,027 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-27 13:25:33,027 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:33,886 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-27 13:25:33,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155049886] [2019-11-27 13:25:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:33,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-27 13:25:33,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008138984] [2019-11-27 13:25:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-27 13:25:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-27 13:25:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 13:25:33,888 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 40 states. [2019-11-27 13:25:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:36,675 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-11-27 13:25:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 13:25:36,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-11-27 13:25:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:36,678 INFO L225 Difference]: With dead ends: 141 [2019-11-27 13:25:36,678 INFO L226 Difference]: Without dead ends: 141 [2019-11-27 13:25:36,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-27 13:25:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-27 13:25:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-27 13:25:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-27 13:25:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-11-27 13:25:36,683 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 114 [2019-11-27 13:25:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:36,684 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-11-27 13:25:36,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-27 13:25:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-11-27 13:25:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 13:25:36,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:36,685 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, 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-27 13:25:36,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-27 13:25:36,896 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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-27 13:25:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash -155348315, now seen corresponding path program 1 times [2019-11-27 13:25:36,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:36,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127784506] [2019-11-27 13:25:36,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 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-27 13:25:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:37,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 13:25:37,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:37,494 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-27 13:25:37,494 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:37,501 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:37,502 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:37,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 13:25:37,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:37,576 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-27 13:25:37,577 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:37,646 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-27 13:25:37,646 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:37,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 13:25:50,133 WARN L192 SmtUtils]: Spent 12.42 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-27 13:25:50,133 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-27 13:25:50,134 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 37 treesize of output 81 [2019-11-27 13:25:50,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:50,195 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-27 13:25:50,195 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:50,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 13:25:50,332 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 13:25:50,333 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-27 13:25:50,333 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:50,354 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:50,354 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:50,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 13:25:51,230 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-27 13:25:51,230 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:51,692 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 13:25:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:53,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:56,051 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 13:25:56,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 13:25:56,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:25:56,320 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 13:25:56,321 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 13:25:56,321 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-27 13:25:56,328 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 13:25:56,328 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 51 treesize of output 21 [2019-11-27 13:25:56,328 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:56,329 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:56,329 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:56,330 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:56,331 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:56,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 13:25:58,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 13:25:58,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:25:58,717 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 13:25:58,718 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 13:25:58,718 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-27 13:25:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,964 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 13:25:58,965 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 13:25:58,965 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-27 13:25:58,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:58,975 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:59,175 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-27 13:25:59,176 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-27 13:25:59,176 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:59,212 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-27 13:25:59,213 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:59,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-27 13:26:00,932 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-27 13:26:00,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127784506] [2019-11-27 13:26:00,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:26:00,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 13:26:00,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146497033] [2019-11-27 13:26:00,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 13:26:00,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:00,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 13:26:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 13:26:00,935 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 55 states. [2019-11-27 13:26:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:07,370 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 13:26:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 13:26:07,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2019-11-27 13:26:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:07,372 INFO L225 Difference]: With dead ends: 60 [2019-11-27 13:26:07,372 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 13:26:07,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 13:26:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 13:26:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 13:26:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 13:26:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 13:26:07,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-27 13:26:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:07,375 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 13:26:07,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 13:26:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 13:26:07,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 13:26:07,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-27 13:26:07,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 01:26:07 BoogieIcfgContainer [2019-11-27 13:26:07,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 13:26:07,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 13:26:07,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 13:26:07,590 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 13:26:07,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:31" (3/4) ... [2019-11-27 13:26:07,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 13:26:07,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 13:26:07,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 13:26:07,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 13:26:07,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 13:26:07,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 13:26:07,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 13:26:07,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 13:26:07,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-27 13:26:07,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 13:26:07,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 13:26:07,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 13:26:07,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 13:26:07,611 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 13:26:07,625 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-11-27 13:26:07,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-27 13:26:07,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 13:26:07,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 13:26:07,628 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 13:26:07,681 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 13:26:07,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 13:26:07,683 INFO L168 Benchmark]: Toolchain (without parser) took 98597.63 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 554.7 MB). Free memory was 956.3 MB in the beginning and 838.8 MB in the end (delta: 117.5 MB). Peak memory consumption was 672.2 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:07,683 INFO L168 Benchmark]: CDTParser took 0.17 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-27 13:26:07,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:07,684 INFO L168 Benchmark]: Boogie Preprocessor took 112.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:26:07,684 INFO L168 Benchmark]: RCFGBuilder took 1592.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:07,685 INFO L168 Benchmark]: TraceAbstraction took 95931.29 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 419.4 MB). Free memory was 970.0 MB in the beginning and 853.3 MB in the end (delta: 116.6 MB). Peak memory consumption was 536.0 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:07,685 INFO L168 Benchmark]: Witness Printer took 92.32 ms. Allocated memory is still 1.6 GB. Free memory was 853.3 MB in the beginning and 838.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:07,687 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.17 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 858.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1592.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95931.29 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 419.4 MB). Free memory was 970.0 MB in the beginning and 853.3 MB in the end (delta: 116.6 MB). Peak memory consumption was 536.0 MB. Max. memory is 11.5 GB. * Witness Printer took 92.32 ms. Allocated memory is still 1.6 GB. Free memory was 853.3 MB in the beginning and 838.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 95.8s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3350 SDtfs, 1546 SDslu, 28036 SDs, 0 SdLazy, 15114 SolverSat, 430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 2739 SyntacticMatches, 67 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 43.1s InterpolantComputationTime, 1631 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3208 ConstructedInterpolants, 503 QuantifiedInterpolants, 1103791 SizeOfPredicates, 171 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 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...