./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 ......................................................................................................................... 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_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:21:31,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:21:31,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:21:31,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:21:31,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:21:31,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:21:31,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:21:31,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:21:31,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:21:31,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:21:31,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:21:31,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:21:31,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:21:31,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:21:31,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:21:31,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:21:31,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:21:31,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:21:31,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:21:31,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:21:31,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:21:31,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:21:31,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:21:31,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:21:31,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:21:31,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:21:31,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:21:31,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:21:31,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:21:31,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:21:31,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:21:31,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:21:31,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:21:31,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:21:31,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:21:31,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:21:31,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:21:31,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:21:31,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:21:31,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:21:31,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:21:31,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 13:21:31,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:21:31,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:21:31,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:21:31,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:21:31,744 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:21:31,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:21:31,745 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:21:31,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:21:31,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:21:31,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:21:31,746 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:21:31,747 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:21:31,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:21:31,747 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:21:31,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:21:31,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:21:31,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:21:31,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:21:31,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:21:31,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:31,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:21:31,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:21:31,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:21:31,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:21:31,750 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 13:21:32,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:21:32,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:21:32,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:21:32,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:21:32,124 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:21:32,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:21:32,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8315e1e43/855dbc7791dd4966a252372961a898a1/FLAG149614238 [2019-11-25 13:21:32,729 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:21:32,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:21:32,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8315e1e43/855dbc7791dd4966a252372961a898a1/FLAG149614238 [2019-11-25 13:21:32,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8315e1e43/855dbc7791dd4966a252372961a898a1 [2019-11-25 13:21:32,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:21:32,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:21:32,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:32,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:21:32,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:21:32,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:32" (1/1) ... [2019-11-25 13:21:32,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7903573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:32, skipping insertion in model container [2019-11-25 13:21:32,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:32" (1/1) ... [2019-11-25 13:21:32,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:21:33,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:33,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:33,497 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-25 13:21:33,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61006790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:33, skipping insertion in model container [2019-11-25 13:21:33,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:33,499 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:21:33,502 INFO L168 Benchmark]: Toolchain (without parser) took 524.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:21:33,503 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:21:33,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:21:33,506 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.13 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 521.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:21:35,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:21:35,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:21:35,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:21:35,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:21:35,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:21:35,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:21:35,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:21:35,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:21:35,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:21:35,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:21:35,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:21:35,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:21:35,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:21:35,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:21:35,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:21:35,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:21:35,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:21:35,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:21:35,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:21:35,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:21:35,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:21:35,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:21:35,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:21:35,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:21:35,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:21:35,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:21:35,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:21:35,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:21:35,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:21:35,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:21:35,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:21:35,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:21:35,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:21:35,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:21:35,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:21:35,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:21:35,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:21:35,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:21:35,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:21:35,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:21:35,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 13:21:35,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:21:35,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:21:35,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:21:35,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:21:35,343 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:21:35,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:21:35,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:21:35,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:21:35,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:21:35,344 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:21:35,345 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:21:35,346 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:21:35,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:21:35,346 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:21:35,347 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:21:35,347 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:21:35,347 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:21:35,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:21:35,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:21:35,348 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:21:35,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:21:35,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:35,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:21:35,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:21:35,350 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:21:35,350 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:21:35,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:21:35,350 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 13:21:35,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:21:35,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:21:35,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:21:35,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:21:35,660 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:21:35,661 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:21:35,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a3c081/ff1a04a865784267bf95fd3d1ca047e7/FLAG988b5d502 [2019-11-25 13:21:36,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:21:36,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:21:36,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a3c081/ff1a04a865784267bf95fd3d1ca047e7/FLAG988b5d502 [2019-11-25 13:21:36,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a3c081/ff1a04a865784267bf95fd3d1ca047e7 [2019-11-25 13:21:36,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:21:36,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:21:36,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:36,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:21:36,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:21:36,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:36" (1/1) ... [2019-11-25 13:21:36,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236deb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:36, skipping insertion in model container [2019-11-25 13:21:36,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:36" (1/1) ... [2019-11-25 13:21:36,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:21:36,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:37,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:37,155 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:21:37,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:37,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:37,242 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:21:37,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:37,416 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:21:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37 WrapperNode [2019-11-25 13:21:37,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:37,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:21:37,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:21:37,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:21:37,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... [2019-11-25 13:21:37,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:21:37,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:21:37,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:21:37,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:21:37,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:21:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:21:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:21:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:21:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:21:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:21:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:21:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:21:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:21:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:21:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:21:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:21:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:21:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:21:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:21:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:21:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:21:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:21:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:21:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:21:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:21:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:21:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:21:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:21:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:21:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:21:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:21:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:21:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:21:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:21:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:21:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:21:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:21:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:21:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:21:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:21:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:21:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:21:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:21:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:21:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:21:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:21:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:21:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:21:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:21:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:21:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:21:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:21:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:21:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:21:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:21:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:21:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:21:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:21:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:21:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:21:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:21:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:21:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:21:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:21:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:21:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:21:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:21:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:21:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:21:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:21:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:21:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:21:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:21:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:21:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:21:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:21:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:21:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:21:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:21:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:21:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:21:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:21:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:21:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:21:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:21:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:21:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:21:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:21:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:21:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:21:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:21:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:21:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:21:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:21:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:21:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:21:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:21:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:21:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:21:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:21:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:21:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:21:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:21:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:21:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:21:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:21:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:21:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:21:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:21:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:21:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:21:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:21:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:21:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:21:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:21:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:21:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:21:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:21:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:21:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:21:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:21:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:21:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:21:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:21:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:21:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:21:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:21:37,603 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:21:37,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:21:37,603 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:21:37,603 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:21:37,604 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:21:37,604 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:21:37,604 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:21:37,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:21:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:21:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:21:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:21:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:21:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:21:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:21:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:21:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:21:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:21:37,608 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:21:37,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:21:37,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:21:37,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:21:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:21:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:21:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:21:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:21:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:21:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:21:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:21:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:21:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:21:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:21:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:21:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:21:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:21:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:21:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:21:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:21:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:21:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:21:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:21:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:21:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:21:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:21:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:21:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:21:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:21:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:21:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:21:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:21:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:21:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:21:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:21:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:21:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:21:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:21:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:21:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:21:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:21:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:21:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:21:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:21:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:21:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:21:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:21:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:21:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:21:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:21:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:21:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:21:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:21:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:21:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:21:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:21:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:21:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:21:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:21:38,300 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:21:38,686 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:21:39,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:21:39,058 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 13:21:39,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:39 BoogieIcfgContainer [2019-11-25 13:21:39,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:21:39,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:21:39,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:21:39,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:21:39,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:21:36" (1/3) ... [2019-11-25 13:21:39,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55775285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:21:39, skipping insertion in model container [2019-11-25 13:21:39,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:37" (2/3) ... [2019-11-25 13:21:39,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55775285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:21:39, skipping insertion in model container [2019-11-25 13:21:39,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:39" (3/3) ... [2019-11-25 13:21:39,071 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2019-11-25 13:21:39,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:21:39,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 13:21:39,106 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 13:21:39,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:21:39,136 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:21:39,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:21:39,137 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:21:39,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:21:39,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:21:39,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:21:39,138 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:21:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-11-25 13:21:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:39,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:39,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:39,185 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash -580210168, now seen corresponding path program 1 times [2019-11-25 13:21:39,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:39,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625499066] [2019-11-25 13:21:39,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:39,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:39,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:39,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:39,468 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:39,476 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:39,476 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:39,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:39,507 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:39,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625499066] [2019-11-25 13:21:39,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:39,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:21:39,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070274338] [2019-11-25 13:21:39,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:39,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:39,593 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-11-25 13:21:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:39,952 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-25 13:21:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:39,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:21:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:39,971 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:21:39,971 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 13:21:39,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 13:21:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2019-11-25 13:21:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 13:21:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-11-25 13:21:40,038 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 17 [2019-11-25 13:21:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:40,038 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-11-25 13:21:40,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-11-25 13:21:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:40,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:40,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:40,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:21:40,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash -580210167, now seen corresponding path program 1 times [2019-11-25 13:21:40,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:40,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61436497] [2019-11-25 13:21:40,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:40,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:21:40,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:40,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:40,444 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:40,451 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:40,451 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:40,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:21:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:40,501 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:40,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61436497] [2019-11-25 13:21:40,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:40,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:21:40,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90148112] [2019-11-25 13:21:40,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:21:40,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:21:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:21:40,825 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 10 states. [2019-11-25 13:21:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:41,536 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-11-25 13:21:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:21:41,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 13:21:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:41,547 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:21:41,547 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 13:21:41,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:21:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 13:21:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-11-25 13:21:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 13:21:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2019-11-25 13:21:41,564 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 17 [2019-11-25 13:21:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:41,564 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2019-11-25 13:21:41,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:21:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2019-11-25 13:21:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:41,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:41,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:41,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:21:41,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -551581017, now seen corresponding path program 1 times [2019-11-25 13:21:41,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:41,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116898103] [2019-11-25 13:21:41,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:41,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:21:41,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:41,957 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:41,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116898103] [2019-11-25 13:21:41,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:41,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:21:42,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533861413] [2019-11-25 13:21:42,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:42,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:42,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:42,001 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2019-11-25 13:21:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:42,030 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2019-11-25 13:21:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:42,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:21:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:42,032 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:21:42,032 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:21:42,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:21:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 13:21:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:21:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-25 13:21:42,045 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 17 [2019-11-25 13:21:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:42,045 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-25 13:21:42,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-25 13:21:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 13:21:42,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:42,047 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] [2019-11-25 13:21:42,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 180429038, now seen corresponding path program 1 times [2019-11-25 13:21:42,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:42,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174907985] [2019-11-25 13:21:42,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:42,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:42,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:42,423 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:42,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174907985] [2019-11-25 13:21:42,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:42,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:21:42,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849514239] [2019-11-25 13:21:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:42,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:42,514 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 5 states. [2019-11-25 13:21:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:42,538 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-25 13:21:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:42,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-25 13:21:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:42,542 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:21:42,542 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:21:42,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:21:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 13:21:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:21:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2019-11-25 13:21:42,554 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 27 [2019-11-25 13:21:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:42,555 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2019-11-25 13:21:42,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2019-11-25 13:21:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 13:21:42,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:42,556 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] [2019-11-25 13:21:42,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:42,765 INFO L82 PathProgramCache]: Analyzing trace with hash -330105139, now seen corresponding path program 1 times [2019-11-25 13:21:42,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:42,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962842898] [2019-11-25 13:21:42,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:42,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:21:42,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:42,967 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:43,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962842898] [2019-11-25 13:21:43,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:43,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 13:21:43,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796731309] [2019-11-25 13:21:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:21:43,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:21:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:21:43,013 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 7 states. [2019-11-25 13:21:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:43,073 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-11-25 13:21:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:21:43,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 13:21:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:43,075 INFO L225 Difference]: With dead ends: 160 [2019-11-25 13:21:43,076 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 13:21:43,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 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-25 13:21:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 13:21:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2019-11-25 13:21:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 13:21:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2019-11-25 13:21:43,087 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 27 [2019-11-25 13:21:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:43,088 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2019-11-25 13:21:43,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:21:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2019-11-25 13:21:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:21:43,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:43,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:43,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,310 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash 317366699, now seen corresponding path program 1 times [2019-11-25 13:21:43,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:43,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115823952] [2019-11-25 13:21:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:43,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:21:43,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:43,470 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:43,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115823952] [2019-11-25 13:21:43,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:43,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:21:43,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521146065] [2019-11-25 13:21:43,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:21:43,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:21:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:21:43,539 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2019-11-25 13:21:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:43,598 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2019-11-25 13:21:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:21:43,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 13:21:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:43,601 INFO L225 Difference]: With dead ends: 159 [2019-11-25 13:21:43,601 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 13:21:43,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:21:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 13:21:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-25 13:21:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-25 13:21:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2019-11-25 13:21:43,611 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 32 [2019-11-25 13:21:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:43,612 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2019-11-25 13:21:43,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:21:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2019-11-25 13:21:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:21:43,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:43,614 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:43,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1135828661, now seen corresponding path program 1 times [2019-11-25 13:21:43,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:43,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780893971] [2019-11-25 13:21:43,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:43,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:43,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780893971] [2019-11-25 13:21:44,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:44,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 13:21:44,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690989920] [2019-11-25 13:21:44,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:21:44,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:21:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:21:44,135 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 10 states. [2019-11-25 13:21:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:44,369 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2019-11-25 13:21:44,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:21:44,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 13:21:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:44,374 INFO L225 Difference]: With dead ends: 163 [2019-11-25 13:21:44,374 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 13:21:44,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:21:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 13:21:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-11-25 13:21:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-25 13:21:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2019-11-25 13:21:44,391 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 34 [2019-11-25 13:21:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:44,392 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2019-11-25 13:21:44,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:21:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2019-11-25 13:21:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 13:21:44,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:44,394 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] [2019-11-25 13:21:44,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash 591246760, now seen corresponding path program 1 times [2019-11-25 13:21:44,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:44,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817178225] [2019-11-25 13:21:44,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:44,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:21:44,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,868 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817178225] [2019-11-25 13:21:44,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:44,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 13:21:44,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522059004] [2019-11-25 13:21:44,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:21:44,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:21:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:21:44,937 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 7 states. [2019-11-25 13:21:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:44,996 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2019-11-25 13:21:44,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:21:44,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 13:21:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:44,998 INFO L225 Difference]: With dead ends: 169 [2019-11-25 13:21:44,998 INFO L226 Difference]: Without dead ends: 169 [2019-11-25 13:21:44,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 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-25 13:21:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-25 13:21:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-11-25 13:21:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 13:21:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2019-11-25 13:21:45,006 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 36 [2019-11-25 13:21:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:45,006 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2019-11-25 13:21:45,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:21:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2019-11-25 13:21:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:21:45,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:45,007 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] [2019-11-25 13:21:45,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash -212953728, now seen corresponding path program 1 times [2019-11-25 13:21:45,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:45,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920783337] [2019-11-25 13:21:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:45,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:21:45,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,359 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920783337] [2019-11-25 13:21:45,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:45,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:21:45,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926093186] [2019-11-25 13:21:45,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:21:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:21:45,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:21:45,478 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 3 states. [2019-11-25 13:21:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:45,675 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2019-11-25 13:21:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:21:45,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-25 13:21:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:45,678 INFO L225 Difference]: With dead ends: 176 [2019-11-25 13:21:45,678 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:21:45,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:21:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:21:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-11-25 13:21:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:21:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2019-11-25 13:21:45,684 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 34 [2019-11-25 13:21:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:45,685 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2019-11-25 13:21:45,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:21:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2019-11-25 13:21:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:21:45,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:45,686 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:45,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,905 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345269, now seen corresponding path program 2 times [2019-11-25 13:21:45,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:45,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979475048] [2019-11-25 13:21:45,907 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:46,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:46,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:46,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:21:46,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:46,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:46,053 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:46,054 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:46,054 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:46,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:21:46,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:21:46,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979475048] [2019-11-25 13:21:46,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:46,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:21:46,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356198566] [2019-11-25 13:21:46,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:21:46,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:21:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:21:46,303 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2019-11-25 13:21:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:47,363 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-11-25 13:21:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:21:47,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 13:21:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:47,365 INFO L225 Difference]: With dead ends: 157 [2019-11-25 13:21:47,366 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 13:21:47,366 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-25 13:21:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 13:21:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2019-11-25 13:21:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 13:21:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2019-11-25 13:21:47,371 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 38 [2019-11-25 13:21:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:47,372 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2019-11-25 13:21:47,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:21:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2019-11-25 13:21:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:21:47,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:47,373 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:47,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:21:47,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345268, now seen corresponding path program 1 times [2019-11-25 13:21:47,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:47,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650019856] [2019-11-25 13:21:47,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:47,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:21:47,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:47,844 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:48,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650019856] [2019-11-25 13:21:48,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:48,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 13:21:48,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457533856] [2019-11-25 13:21:48,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:21:48,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:21:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:21:48,203 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 18 states. [2019-11-25 13:21:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:49,128 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-25 13:21:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:21:49,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 13:21:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:49,130 INFO L225 Difference]: With dead ends: 157 [2019-11-25 13:21:49,130 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 13:21:49,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 13:21:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 13:21:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-25 13:21:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 13:21:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-25 13:21:49,137 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 38 [2019-11-25 13:21:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:49,138 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-25 13:21:49,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:21:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-25 13:21:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 13:21:49,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:49,139 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:49,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:21:49,346 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1038685964, now seen corresponding path program 2 times [2019-11-25 13:21:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:49,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068861422] [2019-11-25 13:21:49,349 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:49,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:49,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:49,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:21:49,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:49,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:49,534 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:49,541 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:49,541 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:49,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:21:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:21:49,796 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:21:50,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068861422] [2019-11-25 13:21:50,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:50,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:21:50,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11621945] [2019-11-25 13:21:50,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:21:50,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:21:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:21:50,649 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-25 13:21:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:53,493 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-11-25 13:21:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:21:53,494 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 13:21:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:53,495 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:21:53,495 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 13:21:53,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:21:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 13:21:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-25 13:21:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 13:21:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-25 13:21:53,502 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 46 [2019-11-25 13:21:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:53,502 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-25 13:21:53,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:21:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-25 13:21:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:21:53,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:53,504 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:53,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:21:53,707 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1614588820, now seen corresponding path program 1 times [2019-11-25 13:21:53,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:53,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612158106] [2019-11-25 13:21:53,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:53,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:21:53,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:54,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:54,203 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 13:21:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612158106] [2019-11-25 13:21:55,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:55,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 13:21:55,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285434685] [2019-11-25 13:21:55,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 13:21:55,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:55,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 13:21:55,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:21:55,168 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 34 states. [2019-11-25 13:21:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:59,229 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2019-11-25 13:21:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-25 13:21:59,230 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 13:21:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:59,232 INFO L225 Difference]: With dead ends: 170 [2019-11-25 13:21:59,232 INFO L226 Difference]: Without dead ends: 166 [2019-11-25 13:21:59,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 13:21:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-25 13:21:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-11-25 13:21:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-25 13:21:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions. [2019-11-25 13:21:59,249 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 51 [2019-11-25 13:21:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:59,249 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions. [2019-11-25 13:21:59,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 13:21:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions. [2019-11-25 13:21:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 13:21:59,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:59,251 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:59,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:21:59,472 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2083027508, now seen corresponding path program 2 times [2019-11-25 13:21:59,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:59,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120519114] [2019-11-25 13:21:59,475 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-25 13:21:59,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:59,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:59,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:21:59,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:59,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:59,636 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:59,638 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:59,638 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:59,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:21:59,796 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:21:59,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120519114] [2019-11-25 13:21:59,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:59,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:21:59,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120820377] [2019-11-25 13:21:59,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:21:59,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:59,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:21:59,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:21:59,877 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 12 states. [2019-11-25 13:22:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:00,776 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2019-11-25 13:22:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:22:00,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-25 13:22:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:00,778 INFO L225 Difference]: With dead ends: 176 [2019-11-25 13:22:00,778 INFO L226 Difference]: Without dead ends: 176 [2019-11-25 13:22:00,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:22:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-25 13:22:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2019-11-25 13:22:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-25 13:22:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2019-11-25 13:22:00,784 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 170 transitions. Word has length 65 [2019-11-25 13:22:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:00,785 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 170 transitions. [2019-11-25 13:22:00,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:22:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 170 transitions. [2019-11-25 13:22:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 13:22:00,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:00,786 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:00,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:22:00,997 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:22:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2083027509, now seen corresponding path program 1 times [2019-11-25 13:22:00,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:00,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188456331] [2019-11-25 13:22:00,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:01,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:22:01,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:01,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:01,239 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:01,246 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:01,246 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:01,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:22:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:01,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:02,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188456331] [2019-11-25 13:22:02,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:02,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:22:02,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819258162] [2019-11-25 13:22:02,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:22:02,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:22:02,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:22:02,300 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand 23 states. [2019-11-25 13:22:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:05,052 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-25 13:22:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:22:05,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-25 13:22:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:05,054 INFO L225 Difference]: With dead ends: 162 [2019-11-25 13:22:05,054 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 13:22:05,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:22:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 13:22:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 13:22:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 13:22:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2019-11-25 13:22:05,060 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 65 [2019-11-25 13:22:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:05,061 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2019-11-25 13:22:05,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:22:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2019-11-25 13:22:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 13:22:05,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:05,062 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:05,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:22:05,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:22:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash -552054101, now seen corresponding path program 1 times [2019-11-25 13:22:05,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:05,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249603204] [2019-11-25 13:22:05,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:05,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:22:05,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:05,557 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:05,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249603204] [2019-11-25 13:22:05,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:05,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:22:05,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170348748] [2019-11-25 13:22:05,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:22:05,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:22:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:22:05,693 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 8 states. [2019-11-25 13:22:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:05,737 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-25 13:22:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:22:05,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-25 13:22:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:05,739 INFO L225 Difference]: With dead ends: 164 [2019-11-25 13:22:05,739 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 13:22:05,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:22:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 13:22:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 13:22:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 13:22:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2019-11-25 13:22:05,744 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 68 [2019-11-25 13:22:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:05,744 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2019-11-25 13:22:05,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:22:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2019-11-25 13:22:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 13:22:05,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:05,746 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:05,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:22:05,959 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-25 13:22:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:05,960 INFO L82 PathProgramCache]: Analyzing trace with hash -188472710, now seen corresponding path program 1 times [2019-11-25 13:22:05,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:05,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448564543] [2019-11-25 13:22:05,962 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-25 13:22:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:06,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:22:06,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:06,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:06,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:06,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448564543] [2019-11-25 13:22:06,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:06,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 13:22:06,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870644340] [2019-11-25 13:22:06,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:22:06,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:22:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:22:06,471 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand 11 states. [2019-11-25 13:22:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:06,586 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-11-25 13:22:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:22:06,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-25 13:22:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:06,588 INFO L225 Difference]: With dead ends: 166 [2019-11-25 13:22:06,588 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 13:22:06,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 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-25 13:22:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 13:22:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 13:22:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 13:22:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-11-25 13:22:06,593 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 73 [2019-11-25 13:22:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:06,593 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-11-25 13:22:06,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:22:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-11-25 13:22:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 13:22:06,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:06,595 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:06,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 13:22:06,816 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-25 13:22:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -85285775, now seen corresponding path program 1 times [2019-11-25 13:22:06,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:06,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953526015] [2019-11-25 13:22:06,818 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-25 13:22:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:07,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 13:22:07,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:07,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:07,087 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:07,088 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:07,089 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:07,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:22:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:07,277 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:07,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953526015] [2019-11-25 13:22:07,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:07,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 14 [2019-11-25 13:22:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113140206] [2019-11-25 13:22:07,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 13:22:07,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:07,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 13:22:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:22:07,502 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 15 states. [2019-11-25 13:22:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:08,696 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-11-25 13:22:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 13:22:08,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2019-11-25 13:22:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:08,697 INFO L225 Difference]: With dead ends: 172 [2019-11-25 13:22:08,698 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 13:22:08,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 13:22:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 13:22:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2019-11-25 13:22:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-25 13:22:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2019-11-25 13:22:08,706 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 84 [2019-11-25 13:22:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:08,706 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2019-11-25 13:22:08,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 13:22:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2019-11-25 13:22:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 13:22:08,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:08,707 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:08,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 13:22:08,920 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-25 13:22:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash -85285774, now seen corresponding path program 1 times [2019-11-25 13:22:08,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:08,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7207205] [2019-11-25 13:22:08,922 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-25 13:22:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:09,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 13:22:09,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:09,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:09,203 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:09,210 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:09,211 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:09,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:22:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:09,679 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:11,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7207205] [2019-11-25 13:22:11,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:11,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2019-11-25 13:22:11,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374538351] [2019-11-25 13:22:11,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-25 13:22:11,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-25 13:22:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-11-25 13:22:11,179 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 29 states. [2019-11-25 13:22:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:15,404 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-25 13:22:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 13:22:15,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2019-11-25 13:22:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:15,406 INFO L225 Difference]: With dead ends: 158 [2019-11-25 13:22:15,406 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 13:22:15,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:22:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 13:22:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-25 13:22:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 13:22:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2019-11-25 13:22:15,412 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 84 [2019-11-25 13:22:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:15,413 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2019-11-25 13:22:15,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-25 13:22:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2019-11-25 13:22:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-25 13:22:15,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:15,414 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:15,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 13:22:15,628 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-25 13:22:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1669081220, now seen corresponding path program 1 times [2019-11-25 13:22:15,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:15,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005345159] [2019-11-25 13:22:15,629 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-25 13:22:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:15,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:22:15,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:15,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:16,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005345159] [2019-11-25 13:22:16,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:16,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 13:22:16,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824908735] [2019-11-25 13:22:16,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:22:16,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:22:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:22:16,112 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 11 states. [2019-11-25 13:22:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:16,199 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2019-11-25 13:22:16,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:22:16,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-11-25 13:22:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:16,201 INFO L225 Difference]: With dead ends: 161 [2019-11-25 13:22:16,201 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 13:22:16,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:22:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 13:22:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-25 13:22:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 13:22:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-11-25 13:22:16,205 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 93 [2019-11-25 13:22:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:16,206 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-11-25 13:22:16,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:22:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-11-25 13:22:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 13:22:16,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:16,208 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:16,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-25 13:22:16,419 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-25 13:22:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -754183911, now seen corresponding path program 1 times [2019-11-25 13:22:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:16,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096336276] [2019-11-25 13:22:16,422 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-25 13:22:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:16,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 13:22:16,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:16,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:16,746 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:16,747 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:16,747 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:16,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:22:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:17,026 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:17,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096336276] [2019-11-25 13:22:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:17,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-25 13:22:17,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136151817] [2019-11-25 13:22:17,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 13:22:17,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 13:22:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:22:17,236 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 17 states. [2019-11-25 13:22:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:18,573 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-11-25 13:22:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:22:18,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-11-25 13:22:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:18,575 INFO L225 Difference]: With dead ends: 172 [2019-11-25 13:22:18,575 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 13:22:18,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 189 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 13:22:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 13:22:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2019-11-25 13:22:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 13:22:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-11-25 13:22:18,581 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 106 [2019-11-25 13:22:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:18,584 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-11-25 13:22:18,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 13:22:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-11-25 13:22:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 13:22:18,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:18,586 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:18,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-25 13:22:18,806 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-25 13:22:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash -754183910, now seen corresponding path program 1 times [2019-11-25 13:22:18,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:18,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431832049] [2019-11-25 13:22:18,808 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-25 13:22:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:19,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:22:19,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:19,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:19,235 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:19,241 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:19,241 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:19,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:22:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:19,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:21,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431832049] [2019-11-25 13:22:21,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:21,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-25 13:22:21,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595177043] [2019-11-25 13:22:21,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 13:22:21,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:21,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 13:22:21,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 13:22:21,424 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 33 states. [2019-11-25 13:22:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:25,513 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-11-25 13:22:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:22:25,516 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-11-25 13:22:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:25,517 INFO L225 Difference]: With dead ends: 154 [2019-11-25 13:22:25,518 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:22:25,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 13:22:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:22:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:22:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:22:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2019-11-25 13:22:25,522 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 106 [2019-11-25 13:22:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:25,523 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2019-11-25 13:22:25,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 13:22:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2019-11-25 13:22:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 13:22:25,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:25,524 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:25,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-25 13:22:25,734 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-25 13:22:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1724966607, now seen corresponding path program 1 times [2019-11-25 13:22:25,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:25,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687733194] [2019-11-25 13:22:25,736 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-25 13:22:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:26,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:22:26,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:26,130 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:26,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687733194] [2019-11-25 13:22:26,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:26,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 13:22:26,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235824439] [2019-11-25 13:22:26,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:22:26,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:22:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:22:26,514 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 11 states. [2019-11-25 13:22:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:26,640 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-11-25 13:22:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:22:26,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-11-25 13:22:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:26,643 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:22:26,643 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:22:26,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 198 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-25 13:22:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:22:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:22:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:22:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-11-25 13:22:26,650 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 104 [2019-11-25 13:22:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-11-25 13:22:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:22:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-11-25 13:22:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 13:22:26,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:26,654 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:26,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-25 13:22:26,868 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-25 13:22:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1351384757, now seen corresponding path program 1 times [2019-11-25 13:22:26,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:26,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724434604] [2019-11-25 13:22:26,869 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-25 13:22:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:27,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 13:22:27,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:27,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:27,266 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:27,269 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:27,269 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:27,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:22:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:27,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:27,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724434604] [2019-11-25 13:22:27,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:27,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-25 13:22:27,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995912790] [2019-11-25 13:22:27,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 13:22:27,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 13:22:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:22:27,911 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 21 states. [2019-11-25 13:22:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:29,556 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2019-11-25 13:22:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:22:29,556 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2019-11-25 13:22:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:29,558 INFO L225 Difference]: With dead ends: 164 [2019-11-25 13:22:29,558 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 13:22:29,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-25 13:22:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 13:22:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-25 13:22:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 13:22:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2019-11-25 13:22:29,567 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 119 [2019-11-25 13:22:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:29,568 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2019-11-25 13:22:29,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 13:22:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2019-11-25 13:22:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 13:22:29,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:29,569 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:29,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-25 13:22:29,779 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-25 13:22:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1351384756, now seen corresponding path program 1 times [2019-11-25 13:22:29,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:29,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195893857] [2019-11-25 13:22:29,782 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-25 13:22:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:30,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-25 13:22:30,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:30,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:22:30,158 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:30,163 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:30,164 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:30,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:22:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:30,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:33,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195893857] [2019-11-25 13:22:33,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:33,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-25 13:22:33,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073931910] [2019-11-25 13:22:33,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-25 13:22:33,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-25 13:22:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 13:22:33,300 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 41 states. [2019-11-25 13:22:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:38,204 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-11-25 13:22:38,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:22:38,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2019-11-25 13:22:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:38,206 INFO L225 Difference]: With dead ends: 150 [2019-11-25 13:22:38,206 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:22:38,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 190 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 13:22:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:22:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:22:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:22:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-11-25 13:22:38,211 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 119 [2019-11-25 13:22:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:38,212 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-11-25 13:22:38,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-25 13:22:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-11-25 13:22:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 13:22:38,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:38,214 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:38,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-25 13:22:38,425 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-25 13:22:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1920404098, now seen corresponding path program 1 times [2019-11-25 13:22:38,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:38,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067928014] [2019-11-25 13:22:38,427 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-25 13:22:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:38,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:22:38,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:39,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:40,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067928014] [2019-11-25 13:22:40,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:40,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-25 13:22:40,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976427742] [2019-11-25 13:22:40,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-25 13:22:40,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-25 13:22:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-25 13:22:40,591 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 40 states. [2019-11-25 13:22:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:42,662 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-11-25 13:22:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:22:42,663 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2019-11-25 13:22:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:42,664 INFO L225 Difference]: With dead ends: 149 [2019-11-25 13:22:42,664 INFO L226 Difference]: Without dead ends: 149 [2019-11-25 13:22:42,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 198 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-25 13:22:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-25 13:22:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-25 13:22:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-25 13:22:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2019-11-25 13:22:42,668 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 122 [2019-11-25 13:22:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:42,668 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2019-11-25 13:22:42,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-25 13:22:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2019-11-25 13:22:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 13:22:42,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:42,670 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:42,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-25 13:22:42,877 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-25 13:22:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1794433551, now seen corresponding path program 1 times [2019-11-25 13:22:42,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:42,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406850425] [2019-11-25 13:22:42,880 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-25 13:22:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:43,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-25 13:22:43,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:43,821 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 15 treesize of output 11 [2019-11-25 13:22:43,822 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:43,830 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:43,831 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:43,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-25 13:22:43,911 INFO L343 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2019-11-25 13:22:43,911 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 25 treesize of output 24 [2019-11-25 13:22:43,912 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:43,925 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:43,926 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:43,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-25 13:22:44,101 INFO L343 Elim1Store]: treesize reduction 12, result has 86.5 percent of original size [2019-11-25 13:22:44,101 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 36 treesize of output 96 [2019-11-25 13:22:44,102 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:44,166 INFO L588 ElimStorePlain]: treesize reduction 58, result has 37.6 percent of original size [2019-11-25 13:22:44,166 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:44,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-25 13:22:44,316 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 13:22:44,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-25 13:22:44,317 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:44,336 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:44,337 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:44,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 13:22:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:22:45,368 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:46,163 WARN L192 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:22:47,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:51,341 WARN L192 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:22:51,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:22:51,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:22:51,556 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 13:22:51,557 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 13:22:51,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-25 13:22:51,565 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 13:22:51,565 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-25 13:22:51,566 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:51,567 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:51,567 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:51,568 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:51,568 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:51,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 13:22:53,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:22:53,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:22:54,087 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 13:22:54,088 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 13:22:54,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-25 13:22:54,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,340 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 13:22:54,341 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 13:22:54,342 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 195 treesize of output 231 [2019-11-25 13:22:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:54,352 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:54,565 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-25 13:22:54,566 INFO L588 ElimStorePlain]: treesize reduction 229, result has 31.6 percent of original size [2019-11-25 13:22:54,566 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:54,611 INFO L588 ElimStorePlain]: treesize reduction 73, result has 33.6 percent of original size [2019-11-25 13:22:54,612 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:54,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-25 13:22:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:22:57,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406850425] [2019-11-25 13:22:57,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:22:57,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 79 [2019-11-25 13:22:57,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288493464] [2019-11-25 13:22:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-25 13:22:57,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-25 13:22:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=5859, Unknown=0, NotChecked=0, Total=6162 [2019-11-25 13:22:57,895 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 79 states. [2019-11-25 13:23:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:23:07,328 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-25 13:23:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-25 13:23:07,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 125 [2019-11-25 13:23:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:23:07,329 INFO L225 Difference]: With dead ends: 72 [2019-11-25 13:23:07,329 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:23:07,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=354, Invalid=6786, Unknown=0, NotChecked=0, Total=7140 [2019-11-25 13:23:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:23:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:23:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:23:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:23:07,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-11-25 13:23:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:23:07,333 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:23:07,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-25 13:23:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:23:07,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:23:07,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-25 13:23:07,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:23:07 BoogieIcfgContainer [2019-11-25 13:23:07,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:23:07,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:23:07,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:23:07,542 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:23:07,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:39" (3/4) ... [2019-11-25 13:23:07,546 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 13:23:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 13:23:07,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 13:23:07,555 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:23:07,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 13:23:07,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 13:23:07,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 13:23:07,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 13:23:07,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 13:23:07,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 13:23:07,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2019-11-25 13:23:07,566 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 13:23:07,566 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:23:07,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:23:07,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:23:07,624 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:23:07,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:23:07,626 INFO L168 Benchmark]: Toolchain (without parser) took 91083.43 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 528.0 MB). Free memory was 956.3 MB in the beginning and 1.5 GB in the end (delta: -521.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-25 13:23:07,626 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:23:07,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:23:07,627 INFO L168 Benchmark]: Boogie Preprocessor took 99.56 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-25 13:23:07,627 INFO L168 Benchmark]: RCFGBuilder took 1542.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.6 MB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. [2019-11-25 13:23:07,627 INFO L168 Benchmark]: TraceAbstraction took 88479.01 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 376.4 MB). Free memory was 988.6 MB in the beginning and 1.5 GB in the end (delta: -502.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:23:07,628 INFO L168 Benchmark]: Witness Printer took 83.09 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-25 13:23:07,629 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.25 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 872.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.56 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 1542.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.6 MB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88479.01 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 376.4 MB). Free memory was 988.6 MB in the beginning and 1.5 GB in the end (delta: -502.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 83.09 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 333 locations, 71 error locations. Result: SAFE, OverallTime: 88.4s, OverallIterations: 27, TraceHistogramMax: 28, AutomataDifference: 43.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3248 SDtfs, 1654 SDslu, 25766 SDs, 0 SdLazy, 14765 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3563 GetRequests, 2958 SyntacticMatches, 67 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3059 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred 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, 98 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3440 ConstructedInterpolants, 586 QuantifiedInterpolants, 1298540 SizeOfPredicates, 165 NumberOfNonLiveVariables, 7504 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 10808/11878 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...