./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................ 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_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e977fbeb632c2e5a16902a6c2250cf608217c650 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 18:57:20,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:57:20,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:57:20,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:57:20,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:57:20,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:57:20,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:57:20,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:57:20,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:57:20,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:57:20,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:57:20,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:57:20,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:57:20,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:57:20,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:57:20,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:57:20,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:57:20,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:57:20,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:57:20,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:57:20,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:57:20,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:57:20,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:57:20,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:57:20,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:57:20,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:57:20,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:57:20,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:57:20,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:57:20,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:57:20,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:57:20,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:57:20,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:57:20,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:57:20,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:57:20,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:57:20,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:57:20,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:57:20,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:57:20,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:57:20,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:57:20,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 18:57:20,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:57:20,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:57:20,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:57:20,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:57:20,427 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:57:20,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:57:20,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:57:20,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:57:20,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:57:20,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:57:20,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:57:20,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:57:20,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:57:20,432 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:57:20,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:57:20,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:57:20,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:57:20,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:57:20,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:57:20,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:57:20,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:57:20,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:57:20,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:57:20,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:57:20,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:57:20,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:57:20,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:57:20,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-27 18:57:20,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:57:20,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:57:20,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:57:20,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:57:20,767 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:57:20,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-27 18:57:20,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f6a7e3/aa3bad63716c4e8e92091c8e6926b25b/FLAGd94b9e14a [2019-11-27 18:57:21,385 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:57:21,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-27 18:57:21,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f6a7e3/aa3bad63716c4e8e92091c8e6926b25b/FLAGd94b9e14a [2019-11-27 18:57:21,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f6a7e3/aa3bad63716c4e8e92091c8e6926b25b [2019-11-27 18:57:21,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:57:21,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:57:21,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:57:21,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:57:21,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:57:21,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:57:21" (1/1) ... [2019-11-27 18:57:21,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c90127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:21, skipping insertion in model container [2019-11-27 18:57:21,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:57:21" (1/1) ... [2019-11-27 18:57:21,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:57:21,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:57:22,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:57:22,333 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-27 18:57:22,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3189b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:22, skipping insertion in model container [2019-11-27 18:57:22,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:57:22,334 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 18:57:22,337 INFO L168 Benchmark]: Toolchain (without parser) took 662.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:57:22,338 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:57:22,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:57:22,342 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.28 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 659.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3c39aff [2019-11-27 18:57:24,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:57:24,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:57:24,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:57:24,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:57:24,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:57:24,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:57:24,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:57:24,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:57:24,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:57:24,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:57:24,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:57:24,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:57:24,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:57:24,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:57:24,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:57:24,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:57:24,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:57:24,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:57:24,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:57:24,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:57:24,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:57:24,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:57:24,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:57:24,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:57:24,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:57:24,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:57:24,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:57:24,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:57:24,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:57:24,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:57:24,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:57:24,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:57:24,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:57:24,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:57:24,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:57:24,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:57:24,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:57:24,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:57:24,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:57:24,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:57:24,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 18:57:24,159 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:57:24,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:57:24,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:57:24,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:57:24,161 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:57:24,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:57:24,162 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:57:24,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:57:24,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:57:24,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:57:24,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:57:24,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:57:24,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:57:24,163 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:57:24,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:57:24,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:57:24,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:57:24,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:57:24,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:57:24,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:57:24,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:57:24,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:57:24,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:57:24,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:57:24,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:57:24,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:57:24,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:57:24,167 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:57:24,168 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:57:24,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:57:24,168 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-27 18:57:24,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:57:24,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:57:24,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:57:24,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:57:24,492 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:57:24,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-27 18:57:24,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31febbc5/240acf1ea1c74279bf85c477435bdea0/FLAG76599bbfc [2019-11-27 18:57:25,119 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:57:25,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-27 18:57:25,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31febbc5/240acf1ea1c74279bf85c477435bdea0/FLAG76599bbfc [2019-11-27 18:57:25,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31febbc5/240acf1ea1c74279bf85c477435bdea0 [2019-11-27 18:57:25,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:57:25,466 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:57:25,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:57:25,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:57:25,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:57:25,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:57:25" (1/1) ... [2019-11-27 18:57:25,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69923c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:25, skipping insertion in model container [2019-11-27 18:57:25,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:57:25" (1/1) ... [2019-11-27 18:57:25,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:57:25,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:57:26,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:57:26,027 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 18:57:26,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:57:26,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:57:26,146 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:57:26,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:57:26,284 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:57:26,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26 WrapperNode [2019-11-27 18:57:26,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:57:26,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:57:26,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:57:26,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:57:26,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... [2019-11-27 18:57:26,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:57:26,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:57:26,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:57:26,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:57:26,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:57:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 18:57:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:57:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:57:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:57:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 18:57:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 18:57:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 18:57:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 18:57:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 18:57:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 18:57:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 18:57:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 18:57:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 18:57:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:57:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 18:57:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 18:57:26,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 18:57:26,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 18:57:26,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 18:57:26,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 18:57:26,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 18:57:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 18:57:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 18:57:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 18:57:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 18:57:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 18:57:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 18:57:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 18:57:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 18:57:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 18:57:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 18:57:26,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 18:57:26,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 18:57:26,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 18:57:26,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 18:57:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 18:57:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 18:57:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 18:57:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 18:57:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 18:57:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 18:57:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 18:57:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 18:57:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 18:57:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 18:57:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 18:57:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 18:57:26,462 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 18:57:26,462 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 18:57:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 18:57:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 18:57:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 18:57:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 18:57:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 18:57:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 18:57:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 18:57:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 18:57:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 18:57:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 18:57:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 18:57:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 18:57:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 18:57:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 18:57:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 18:57:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 18:57:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 18:57:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 18:57:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 18:57:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 18:57:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 18:57:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 18:57:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 18:57:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 18:57:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 18:57:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 18:57:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 18:57:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 18:57:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 18:57:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 18:57:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 18:57:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 18:57:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 18:57:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 18:57:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 18:57:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 18:57:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 18:57:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 18:57:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 18:57:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 18:57:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 18:57:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 18:57:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 18:57:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 18:57:26,473 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 18:57:26,473 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 18:57:26,473 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 18:57:26,473 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 18:57:26,473 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 18:57:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 18:57:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 18:57:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 18:57:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 18:57:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 18:57:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 18:57:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 18:57:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 18:57:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 18:57:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 18:57:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 18:57:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 18:57:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 18:57:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 18:57:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 18:57:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 18:57:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 18:57:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 18:57:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 18:57:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 18:57:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 18:57:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 18:57:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 18:57:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 18:57:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 18:57:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 18:57:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 18:57:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 18:57:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 18:57:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 18:57:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 18:57:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 18:57:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 18:57:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 18:57:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 18:57:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 18:57:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 18:57:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 18:57:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 18:57:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 18:57:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 18:57:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 18:57:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 18:57:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 18:57:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 18:57:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 18:57:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 18:57:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 18:57:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:57:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 18:57:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 18:57:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:57:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 18:57:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 18:57:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 18:57:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 18:57:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 18:57:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 18:57:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 18:57:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 18:57:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 18:57:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 18:57:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 18:57:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:57:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 18:57:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 18:57:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 18:57:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 18:57:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 18:57:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 18:57:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 18:57:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 18:57:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 18:57:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:57:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 18:57:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 18:57:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 18:57:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 18:57:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 18:57:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 18:57:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 18:57:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 18:57:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 18:57:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 18:57:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 18:57:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 18:57:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 18:57:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 18:57:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 18:57:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 18:57:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 18:57:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:57:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 18:57:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:57:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:57:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 18:57:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 18:57:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 18:57:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 18:57:27,226 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:57:27,594 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:57:27,927 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:57:27,928 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 18:57:27,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:57:27 BoogieIcfgContainer [2019-11-27 18:57:27,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:57:27,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:57:27,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:57:27,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:57:27,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:57:25" (1/3) ... [2019-11-27 18:57:27,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4c6a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:57:27, skipping insertion in model container [2019-11-27 18:57:27,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:57:26" (2/3) ... [2019-11-27 18:57:27,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4c6a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:57:27, skipping insertion in model container [2019-11-27 18:57:27,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:57:27" (3/3) ... [2019-11-27 18:57:27,940 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-11-27 18:57:27,953 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:57:27,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 18:57:27,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 18:57:28,019 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:57:28,019 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 18:57:28,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:57:28,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:57:28,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:57:28,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:57:28,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:57:28,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:57:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-27 18:57:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:57:28,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:28,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:28,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-11-27 18:57:28,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:28,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884899407] [2019-11-27 18:57:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:28,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:57:28,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:28,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:28,351 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:28,362 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:28,362 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:28,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:28,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:28,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884899407] [2019-11-27 18:57:28,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:28,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 18:57:28,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631072372] [2019-11-27 18:57:28,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:57:28,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:57:28,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:28,482 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-27 18:57:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:28,793 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-27 18:57:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:57:28,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:57:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:28,829 INFO L225 Difference]: With dead ends: 133 [2019-11-27 18:57:28,829 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 18:57:28,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 18:57:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-11-27 18:57:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-27 18:57:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-27 18:57:28,931 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-11-27 18:57:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:28,931 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-27 18:57:28,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:57:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-27 18:57:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:57:28,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:28,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:29,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:57:29,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-11-27 18:57:29,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:29,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252030616] [2019-11-27 18:57:29,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:29,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:57:29,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:29,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:29,325 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:29,335 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:29,336 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:29,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:29,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:29,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252030616] [2019-11-27 18:57:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 18:57:29,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196810992] [2019-11-27 18:57:29,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:57:29,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:57:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:57:29,749 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-27 18:57:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:30,416 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-27 18:57:30,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:57:30,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 18:57:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:30,419 INFO L225 Difference]: With dead ends: 129 [2019-11-27 18:57:30,420 INFO L226 Difference]: Without dead ends: 129 [2019-11-27 18:57:30,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:57:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-27 18:57:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-27 18:57:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-27 18:57:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-27 18:57:30,431 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-11-27 18:57:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:30,432 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-27 18:57:30,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:57:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-27 18:57:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:57:30,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:30,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:30,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:57:30,645 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-11-27 18:57:30,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:30,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215174815] [2019-11-27 18:57:30,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:30,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:57:30,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:30,825 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:30,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215174815] [2019-11-27 18:57:30,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:30,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:57:30,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857307481] [2019-11-27 18:57:30,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:57:30,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:57:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:30,872 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-11-27 18:57:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:30,915 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-27 18:57:30,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:57:30,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:57:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:30,919 INFO L225 Difference]: With dead ends: 123 [2019-11-27 18:57:30,923 INFO L226 Difference]: Without dead ends: 123 [2019-11-27 18:57:30,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-27 18:57:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-27 18:57:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-27 18:57:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-27 18:57:30,947 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-11-27 18:57:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:30,947 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-27 18:57:30,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:57:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-27 18:57:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 18:57:30,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:30,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:31,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:57:31,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-11-27 18:57:31,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:31,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603433028] [2019-11-27 18:57:31,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:31,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:57:31,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:31,365 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:31,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603433028] [2019-11-27 18:57:31,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:31,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:57:31,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145738681] [2019-11-27 18:57:31,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:57:31,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:57:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:31,454 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-11-27 18:57:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:31,495 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-27 18:57:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:57:31,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 18:57:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:31,498 INFO L225 Difference]: With dead ends: 123 [2019-11-27 18:57:31,500 INFO L226 Difference]: Without dead ends: 123 [2019-11-27 18:57:31,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:57:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-27 18:57:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-27 18:57:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-27 18:57:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-27 18:57:31,518 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-11-27 18:57:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:31,518 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-27 18:57:31,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:57:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-27 18:57:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 18:57:31,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:31,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:31,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:57:31,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:31,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-11-27 18:57:31,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:31,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46200798] [2019-11-27 18:57:31,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:31,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:57:31,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:31,979 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:32,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46200798] [2019-11-27 18:57:32,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:32,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 18:57:32,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772600569] [2019-11-27 18:57:32,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:57:32,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:57:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:57:32,045 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-11-27 18:57:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:32,117 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-27 18:57:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:57:32,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-27 18:57:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:32,121 INFO L225 Difference]: With dead ends: 134 [2019-11-27 18:57:32,121 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 18:57:32,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:57:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 18:57:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-27 18:57:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-27 18:57:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-27 18:57:32,142 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-27 18:57:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:32,143 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-27 18:57:32,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:57:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-27 18:57:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:57:32,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:32,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:32,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 18:57:32,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-11-27 18:57:32,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:32,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291386755] [2019-11-27 18:57:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:32,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 18:57:32,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:32,523 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:32,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291386755] [2019-11-27 18:57:32,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:32,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 18:57:32,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863544990] [2019-11-27 18:57:32,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:57:32,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:57:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:57:32,587 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-11-27 18:57:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:32,628 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-27 18:57:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:57:32,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 18:57:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:32,633 INFO L225 Difference]: With dead ends: 136 [2019-11-27 18:57:32,633 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 18:57:32,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:57:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 18:57:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-27 18:57:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-27 18:57:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-11-27 18:57:32,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-11-27 18:57:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:32,649 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-11-27 18:57:32,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:57:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-11-27 18:57:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 18:57:32,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:32,653 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:32,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 18:57:32,854 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-11-27 18:57:32,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:32,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065146167] [2019-11-27 18:57:32,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:32,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:57:32,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:33,035 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:33,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065146167] [2019-11-27 18:57:33,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:57:33,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:57:33,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839576338] [2019-11-27 18:57:33,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:57:33,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:57:33,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:57:33,152 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-11-27 18:57:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:33,416 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-27 18:57:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:57:33,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 18:57:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:33,419 INFO L225 Difference]: With dead ends: 140 [2019-11-27 18:57:33,419 INFO L226 Difference]: Without dead ends: 136 [2019-11-27 18:57:33,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:57:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-27 18:57:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-27 18:57:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-27 18:57:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-27 18:57:33,428 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-11-27 18:57:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:33,429 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-27 18:57:33,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:57:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-27 18:57:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:57:33,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:33,430 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:33,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 18:57:33,643 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-11-27 18:57:33,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:33,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607881853] [2019-11-27 18:57:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:33,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:57:33,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 18:57:33,824 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 18:57:34,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607881853] [2019-11-27 18:57:34,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:34,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:57:34,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729996571] [2019-11-27 18:57:34,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 18:57:34,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 18:57:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:57:34,018 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-11-27 18:57:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:34,192 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-27 18:57:34,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 18:57:34,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-27 18:57:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:34,194 INFO L225 Difference]: With dead ends: 147 [2019-11-27 18:57:34,194 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 18:57:34,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:57:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 18:57:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-27 18:57:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-27 18:57:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-27 18:57:34,201 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-11-27 18:57:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:34,201 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-27 18:57:34,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 18:57:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-27 18:57:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:57:34,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:34,202 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:34,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 18:57:34,414 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-11-27 18:57:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:34,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404217030] [2019-11-27 18:57:34,416 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 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:34,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:57:34,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:57:34,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:57:34,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:34,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:34,557 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:34,559 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:34,559 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:34,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-27 18:57:34,730 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-27 18:57:34,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404217030] [2019-11-27 18:57:34,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:34,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:57:34,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243462771] [2019-11-27 18:57:34,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:57:34,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:57:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:57:34,797 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-11-27 18:57:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:35,690 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-27 18:57:35,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:57:35,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 18:57:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:35,692 INFO L225 Difference]: With dead ends: 146 [2019-11-27 18:57:35,692 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:57:35,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:57:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:57:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-11-27 18:57:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-27 18:57:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-11-27 18:57:35,700 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-11-27 18:57:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:35,700 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-11-27 18:57:35,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:57:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-11-27 18:57:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:57:35,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:35,701 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:35,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 18:57:35,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-11-27 18:57:35,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757126381] [2019-11-27 18:57:35,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:36,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:57:36,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:36,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:36,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757126381] [2019-11-27 18:57:36,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:57:36,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 18:57:36,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397299647] [2019-11-27 18:57:36,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:57:36,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:57:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:57:36,507 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-11-27 18:57:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:37,416 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-27 18:57:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:57:37,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 18:57:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:37,418 INFO L225 Difference]: With dead ends: 134 [2019-11-27 18:57:37,418 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 18:57:37,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:57:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 18:57:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-27 18:57:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-27 18:57:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-11-27 18:57:37,424 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-11-27 18:57:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:37,425 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-11-27 18:57:37,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:57:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-11-27 18:57:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 18:57:37,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:37,426 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:37,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 18:57:37,634 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-11-27 18:57:37,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:37,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046429705] [2019-11-27 18:57:37,636 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 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:37,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:57:37,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:57:37,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:57:37,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:37,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:37,789 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:37,797 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:37,797 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:37,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 18:57:38,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 18:57:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046429705] [2019-11-27 18:57:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:57:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958386725] [2019-11-27 18:57:38,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:57:38,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:57:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:57:38,893 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-11-27 18:57:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:41,555 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-27 18:57:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:57:41,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 18:57:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:41,557 INFO L225 Difference]: With dead ends: 129 [2019-11-27 18:57:41,557 INFO L226 Difference]: Without dead ends: 129 [2019-11-27 18:57:41,558 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-27 18:57:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-27 18:57:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-27 18:57:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 18:57:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-27 18:57:41,563 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-11-27 18:57:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:41,563 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-27 18:57:41,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:57:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-27 18:57:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 18:57:41,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:41,565 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:41,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 18:57:41,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-11-27 18:57:41,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:41,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775564428] [2019-11-27 18:57:41,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:41,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 18:57:41,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:42,162 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:42,279 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 18:57:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:57:43,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775564428] [2019-11-27 18:57:43,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:57:43,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 18:57:43,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851636132] [2019-11-27 18:57:43,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 18:57:43,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 18:57:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 18:57:43,121 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-11-27 18:57:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:43,911 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-11-27 18:57:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:57:43,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 18:57:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:43,917 INFO L225 Difference]: With dead ends: 135 [2019-11-27 18:57:43,917 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 18:57:43,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 18:57:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 18:57:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 18:57:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 18:57:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-27 18:57:43,925 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 51 [2019-11-27 18:57:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:43,926 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-27 18:57:43,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 18:57:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-27 18:57:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:57:43,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:43,932 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:44,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 18:57:44,141 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -346949160, now seen corresponding path program 2 times [2019-11-27 18:57:44,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:44,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662199786] [2019-11-27 18:57:44,144 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 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:44,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:57:44,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:57:44,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:57:44,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:44,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:44,307 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:44,311 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:44,311 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:44,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:44,534 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:44,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662199786] [2019-11-27 18:57:44,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:44,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:57:44,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472566147] [2019-11-27 18:57:44,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:57:44,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:44,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:57:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:57:44,611 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 12 states. [2019-11-27 18:57:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:45,471 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-27 18:57:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:57:45,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 18:57:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:45,474 INFO L225 Difference]: With dead ends: 153 [2019-11-27 18:57:45,474 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:57:45,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:57:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:57:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2019-11-27 18:57:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 18:57:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-27 18:57:45,481 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 53 [2019-11-27 18:57:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:45,482 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-27 18:57:45,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:57:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-27 18:57:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:57:45,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:45,483 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:45,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 18:57:45,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash -346949159, now seen corresponding path program 1 times [2019-11-27 18:57:45,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:45,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791884420] [2019-11-27 18:57:45,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:45,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:57:45,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:45,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:45,907 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:45,912 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:45,912 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:45,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:46,174 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:46,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791884420] [2019-11-27 18:57:46,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:46,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:57:46,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287269120] [2019-11-27 18:57:46,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:57:46,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:57:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:57:46,992 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2019-11-27 18:57:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:49,127 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-27 18:57:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:57:49,128 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 18:57:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:49,130 INFO L225 Difference]: With dead ends: 127 [2019-11-27 18:57:49,130 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 18:57:49,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 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-27 18:57:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 18:57:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-27 18:57:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 18:57:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-27 18:57:49,136 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 53 [2019-11-27 18:57:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:49,136 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-27 18:57:49,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:57:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-27 18:57:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-27 18:57:49,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:49,137 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:49,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 18:57:49,346 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1487182461, now seen corresponding path program 1 times [2019-11-27 18:57:49,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:49,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710907389] [2019-11-27 18:57:49,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:49,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:57:49,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:49,570 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:49,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710907389] [2019-11-27 18:57:49,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:49,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 18:57:49,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312939138] [2019-11-27 18:57:49,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:57:49,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:57:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:57:49,706 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-11-27 18:57:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:49,763 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-27 18:57:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:57:49,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-27 18:57:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:49,766 INFO L225 Difference]: With dead ends: 129 [2019-11-27 18:57:49,766 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 18:57:49,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:57:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 18:57:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-27 18:57:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 18:57:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2019-11-27 18:57:49,771 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 58 [2019-11-27 18:57:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:49,772 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2019-11-27 18:57:49,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:57:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2019-11-27 18:57:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-27 18:57:49,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:49,773 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:49,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 18:57:49,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -537222574, now seen corresponding path program 1 times [2019-11-27 18:57:49,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:49,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696210080] [2019-11-27 18:57:49,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:50,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:57:50,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:50,251 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:50,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:57:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:50,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696210080] [2019-11-27 18:57:50,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:50,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 18:57:50,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439441199] [2019-11-27 18:57:50,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:57:50,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:50,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:57:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:57:50,482 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 11 states. [2019-11-27 18:57:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:50,581 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-11-27 18:57:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:57:50,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-27 18:57:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:50,587 INFO L225 Difference]: With dead ends: 131 [2019-11-27 18:57:50,587 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 18:57:50,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:57:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 18:57:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-27 18:57:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 18:57:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-11-27 18:57:50,592 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 63 [2019-11-27 18:57:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:50,592 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-11-27 18:57:50,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:57:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-11-27 18:57:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 18:57:50,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:50,593 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:50,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 18:57:50,800 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash -964060479, now seen corresponding path program 1 times [2019-11-27 18:57:50,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:50,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390816844] [2019-11-27 18:57:50,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:51,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 18:57:51,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:51,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:51,044 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:51,046 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:51,046 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:51,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:51,318 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:51,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390816844] [2019-11-27 18:57:51,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:51,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 18:57:51,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568930407] [2019-11-27 18:57:51,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 18:57:51,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:51,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 18:57:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:57:51,530 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 17 states. [2019-11-27 18:57:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:52,843 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2019-11-27 18:57:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-27 18:57:52,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-27 18:57:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:52,845 INFO L225 Difference]: With dead ends: 178 [2019-11-27 18:57:52,845 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 18:57:52,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 18:57:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 18:57:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-11-27 18:57:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 18:57:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-11-27 18:57:52,854 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 74 [2019-11-27 18:57:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:52,855 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-11-27 18:57:52,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 18:57:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-11-27 18:57:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 18:57:52,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:52,856 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:53,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 18:57:53,062 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash -964060478, now seen corresponding path program 1 times [2019-11-27 18:57:53,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:53,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453715694] [2019-11-27 18:57:53,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:53,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 18:57:53,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:53,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:57:53,314 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,319 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:53,319 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:53,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:55,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453715694] [2019-11-27 18:57:55,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:55,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 18:57:55,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537402947] [2019-11-27 18:57:55,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 18:57:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 18:57:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 18:57:55,863 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 33 states. [2019-11-27 18:57:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:59,378 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-27 18:57:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:57:59,378 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-27 18:57:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:59,380 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:57:59,380 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:57:59,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 18:57:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:57:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-27 18:57:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 18:57:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-11-27 18:57:59,387 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 74 [2019-11-27 18:57:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:59,388 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-11-27 18:57:59,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 18:57:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-11-27 18:57:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-27 18:57:59,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:59,389 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:59,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 18:57:59,591 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -770520951, now seen corresponding path program 1 times [2019-11-27 18:57:59,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:59,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522985181] [2019-11-27 18:57:59,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:59,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:57:59,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:57:59,894 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-27 18:58:00,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522985181] [2019-11-27 18:58:00,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:58:00,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-11-27 18:58:00,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250204630] [2019-11-27 18:58:00,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:58:00,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:58:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:00,158 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-11-27 18:58:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:00,260 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-11-27 18:58:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:58:00,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-11-27 18:58:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:00,262 INFO L225 Difference]: With dead ends: 153 [2019-11-27 18:58:00,262 INFO L226 Difference]: Without dead ends: 149 [2019-11-27 18:58:00,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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-27 18:58:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-27 18:58:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-27 18:58:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-27 18:58:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2019-11-27 18:58:00,269 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 77 [2019-11-27 18:58:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:00,269 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2019-11-27 18:58:00,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:58:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2019-11-27 18:58:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-27 18:58:00,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:00,270 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:00,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 18:58:00,480 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash 810528448, now seen corresponding path program 1 times [2019-11-27 18:58:00,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:00,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919502111] [2019-11-27 18:58:00,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:00,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 18:58:00,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:00,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:58:00,753 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:00,755 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:00,755 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:00,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:01,164 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:01,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919502111] [2019-11-27 18:58:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:01,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-27 18:58:01,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686002818] [2019-11-27 18:58:01,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 18:58:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:01,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 18:58:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:58:01,399 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 21 states. [2019-11-27 18:58:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:03,084 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-11-27 18:58:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-27 18:58:03,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-27 18:58:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:03,086 INFO L225 Difference]: With dead ends: 180 [2019-11-27 18:58:03,086 INFO L226 Difference]: Without dead ends: 180 [2019-11-27 18:58:03,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-27 18:58:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-27 18:58:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2019-11-27 18:58:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 18:58:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-11-27 18:58:03,093 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-11-27 18:58:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:03,094 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-11-27 18:58:03,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 18:58:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-11-27 18:58:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-27 18:58:03,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:03,095 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:03,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 18:58:03,309 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 810528449, now seen corresponding path program 1 times [2019-11-27 18:58:03,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:03,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746448019] [2019-11-27 18:58:03,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:03,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-27 18:58:03,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:03,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:58:03,601 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:03,607 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:03,607 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:03,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:58:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:04,202 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:06,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746448019] [2019-11-27 18:58:06,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:06,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-27 18:58:06,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605514896] [2019-11-27 18:58:06,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-27 18:58:06,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-27 18:58:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 18:58:06,620 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 41 states. [2019-11-27 18:58:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:11,148 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-27 18:58:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:58:11,149 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-11-27 18:58:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:11,150 INFO L225 Difference]: With dead ends: 153 [2019-11-27 18:58:11,150 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:58:11,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-27 18:58:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:58:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-27 18:58:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-27 18:58:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2019-11-27 18:58:11,157 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 87 [2019-11-27 18:58:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:11,158 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2019-11-27 18:58:11,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-27 18:58:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2019-11-27 18:58:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-27 18:58:11,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:11,160 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:11,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 18:58:11,361 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 147123437, now seen corresponding path program 1 times [2019-11-27 18:58:11,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:11,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934046938] [2019-11-27 18:58:11,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:11,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:58:11,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:12,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:13,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934046938] [2019-11-27 18:58:13,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:13,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-27 18:58:13,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922425334] [2019-11-27 18:58:13,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-27 18:58:13,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:13,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-27 18:58:13,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 18:58:13,245 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 40 states. [2019-11-27 18:58:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:15,371 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-27 18:58:15,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:58:15,374 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-11-27 18:58:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:15,375 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:58:15,375 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:58:15,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-27 18:58:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:58:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-27 18:58:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 18:58:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2019-11-27 18:58:15,381 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 90 [2019-11-27 18:58:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:15,381 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2019-11-27 18:58:15,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-27 18:58:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2019-11-27 18:58:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-27 18:58:15,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:15,383 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:15,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 18:58:15,594 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002500, now seen corresponding path program 1 times [2019-11-27 18:58:15,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:15,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233573279] [2019-11-27 18:58:15,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:15,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 18:58:15,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:16,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-27 18:58:16,146 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:16,155 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:16,155 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:16,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 18:58:16,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:16,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-27 18:58:16,224 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:16,260 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-27 18:58:16,260 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:16,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-27 18:58:28,695 WARN L192 SmtUtils]: Spent 12.37 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-27 18:58:28,696 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-27 18:58:28,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-27 18:58:28,697 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:28,756 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-27 18:58:28,757 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:28,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 18:58:28,925 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 18:58:28,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-27 18:58:28,926 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:28,943 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:28,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:28,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 18:58:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:29,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:30,040 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:58:31,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:33,986 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:58:34,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:58:34,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:58:34,239 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 18:58:34,240 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 18:58:34,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-27 18:58:34,248 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 18:58:34,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-27 18:58:34,249 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:34,250 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:34,250 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:34,251 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:34,251 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:34,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 18:58:36,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:58:36,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:58:36,852 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 18:58:36,853 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 18:58:36,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-27 18:58:36,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:36,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,192 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 18:58:37,193 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 18:58:37,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-27 18:58:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:37,207 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:37,370 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-11-27 18:58:37,372 INFO L588 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2019-11-27 18:58:37,372 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:37,436 INFO L588 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-27 18:58:37,436 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:37,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-27 18:58:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233573279] [2019-11-27 18:58:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 18:58:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241012366] [2019-11-27 18:58:38,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 18:58:38,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 18:58:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 18:58:38,893 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 55 states. [2019-11-27 18:58:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:44,157 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 18:58:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 18:58:44,158 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 93 [2019-11-27 18:58:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:44,158 INFO L225 Difference]: With dead ends: 60 [2019-11-27 18:58:44,158 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 18:58:44,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 18:58:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 18:58:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 18:58:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 18:58:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 18:58:44,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2019-11-27 18:58:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:44,160 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 18:58:44,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 18:58:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 18:58:44,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 18:58:44,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 18:58:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 06:58:44 BoogieIcfgContainer [2019-11-27 18:58:44,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 18:58:44,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 18:58:44,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 18:58:44,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 18:58:44,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:57:27" (3/4) ... [2019-11-27 18:58:44,373 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 18:58:44,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 18:58:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 18:58:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:44,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 18:58:44,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 18:58:44,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 18:58:44,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2019-11-27 18:58:44,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-27 18:58:44,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 18:58:44,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 18:58:44,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 18:58:44,456 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 18:58:44,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 18:58:44,458 INFO L168 Benchmark]: Toolchain (without parser) took 78992.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -116.5 MB). Peak memory consumption was 372.6 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:44,458 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:44,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:44,459 INFO L168 Benchmark]: Boogie Preprocessor took 109.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-27 18:58:44,459 INFO L168 Benchmark]: RCFGBuilder took 1534.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.7 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:44,459 INFO L168 Benchmark]: TraceAbstraction took 76437.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -103.4 MB). Peak memory consumption was 239.5 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:44,460 INFO L168 Benchmark]: Witness Printer took 87.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:44,461 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 818.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.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 1534.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.7 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76437.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -103.4 MB). Peak memory consumption was 239.5 MB. Max. memory is 11.5 GB. * Witness Printer took 87.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 332 locations, 71 error locations. Result: SAFE, OverallTime: 76.3s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2367 SDtfs, 1231 SDslu, 17957 SDs, 0 SdLazy, 10850 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2427 GetRequests, 1943 SyntacticMatches, 48 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 21.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=20, 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, 23 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2332 ConstructedInterpolants, 306 QuantifiedInterpolants, 692552 SizeOfPredicates, 140 NumberOfNonLiveVariables, 5227 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 2985/3518 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...