./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.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_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d88c88b73ce2cba22159e6d055a27f0c7e4ebba5 ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 d88c88b73ce2cba22159e6d055a27f0c7e4ebba5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:45,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:56:45,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:56:45,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:56:45,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:56:45,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:56:45,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:56:45,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:56:45,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:56:45,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:56:45,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:56:45,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:56:45,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:56:45,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:56:45,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:56:45,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:56:45,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:56:45,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:56:45,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:56:45,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:56:45,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:56:45,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:56:45,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:56:45,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:56:45,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:56:45,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:56:45,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:56:45,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:56:45,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:56:45,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:56:45,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:56:45,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:56:45,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:56:45,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:56:45,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:56:45,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:56:45,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:56:45,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:56:45,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:56:45,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:56:45,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:56:45,130 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:56:45,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:56:45,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:56:45,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:56:45,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:56:45,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:56:45,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:56:45,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:56:45,148 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:56:45,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:56:45,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:56:45,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:56:45,149 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:56:45,149 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:56:45,150 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:56:45,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:56:45,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:56:45,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:56:45,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:56:45,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:56:45,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:56:45,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:56:45,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:56:45,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:56:45,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:56:45,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:56:45,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:56:45,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:56:45,153 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 -> d88c88b73ce2cba22159e6d055a27f0c7e4ebba5 [2019-11-27 18:56:45,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:56:45,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:56:45,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:56:45,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:56:45,512 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:56:45,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-27 18:56:45,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d0ac003/b7119ac23d64450886c63102b4854fdd/FLAG01580659e [2019-11-27 18:56:46,141 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:56:46,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-27 18:56:46,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d0ac003/b7119ac23d64450886c63102b4854fdd/FLAG01580659e [2019-11-27 18:56:46,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d0ac003/b7119ac23d64450886c63102b4854fdd [2019-11-27 18:56:46,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:56:46,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:56:46,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:56:46,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:56:46,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:56:46,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:56:46" (1/1) ... [2019-11-27 18:56:46,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699f7eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:46, skipping insertion in model container [2019-11-27 18:56:46,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:56:46" (1/1) ... [2019-11-27 18:56:46,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:56:46,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:56:46,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:56:46,984 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:56:46,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69259ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:46, skipping insertion in model container [2019-11-27 18:56:46,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:56:46,986 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 18:56:46,989 INFO L168 Benchmark]: Toolchain (without parser) took 561.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:56:46,990 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:56:46,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:56:46,994 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 558.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 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:56:48,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:56:48,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:56:48,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:56:48,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:56:48,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:56:48,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:56:48,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:56:48,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:56:48,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:56:48,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:56:48,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:56:48,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:56:48,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:56:48,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:56:48,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:56:48,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:56:48,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:56:48,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:56:48,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:56:48,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:56:48,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:56:48,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:56:48,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:56:48,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:56:48,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:56:48,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:56:48,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:56:48,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:56:48,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:56:48,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:56:48,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:56:48,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:56:48,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:56:48,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:56:48,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:56:48,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:56:48,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:56:48,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:56:48,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:56:48,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:56:48,713 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:56:48,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:56:48,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:56:48,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:56:48,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:56:48,732 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:56:48,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:56:48,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:56:48,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:56:48,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:56:48,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:56:48,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:56:48,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:56:48,735 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:56:48,735 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:56:48,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:56:48,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:56:48,736 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:56:48,736 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:56:48,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:56:48,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:56:48,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:56:48,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:56:48,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:56:48,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:56:48,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:56:48,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:56:48,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:56:48,739 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:56:48,739 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:56:48,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:56:48,739 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 -> d88c88b73ce2cba22159e6d055a27f0c7e4ebba5 [2019-11-27 18:56:49,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:56:49,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:56:49,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:56:49,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:56:49,077 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:56:49,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-27 18:56:49,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b771f362f/ce700486a1574b3ba3b5dee84f8ec193/FLAGaa28779fe [2019-11-27 18:56:49,603 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:56:49,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-27 18:56:49,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b771f362f/ce700486a1574b3ba3b5dee84f8ec193/FLAGaa28779fe [2019-11-27 18:56:49,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b771f362f/ce700486a1574b3ba3b5dee84f8ec193 [2019-11-27 18:56:49,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:56:49,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:56:49,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:56:49,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:56:49,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:56:49,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:56:49" (1/1) ... [2019-11-27 18:56:49,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423e9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:49, skipping insertion in model container [2019-11-27 18:56:49,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:56:49" (1/1) ... [2019-11-27 18:56:49,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:56:49,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:56:50,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:56:50,497 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 18:56:50,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:56:50,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:56:50,605 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:56:50,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:56:50,762 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:56:50,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50 WrapperNode [2019-11-27 18:56:50,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:56:50,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:56:50,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:56:50,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:56:50,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (1/1) ... [2019-11-27 18:56:50,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:56:50,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:56:50,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:56:50,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:56:50,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (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:56:50,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 18:56:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:56:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:56:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:56:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 18:56:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 18:56:50,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 18:56:50,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 18:56:50,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 18:56:50,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 18:56:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 18:56:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 18:56:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 18:56:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:56:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 18:56:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 18:56:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 18:56:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 18:56:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 18:56:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 18:56:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 18:56:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 18:56:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 18:56:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 18:56:50,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 18:56:50,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 18:56:50,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 18:56:50,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 18:56:50,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 18:56:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 18:56:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 18:56:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 18:56:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 18:56:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 18:56:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 18:56:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 18:56:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 18:56:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 18:56:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 18:56:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 18:56:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 18:56:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 18:56:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 18:56:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 18:56:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 18:56:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 18:56:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 18:56:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 18:56:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 18:56:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 18:56:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 18:56:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 18:56:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 18:56:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 18:56:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 18:56:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 18:56:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 18:56:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 18:56:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 18:56:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 18:56:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 18:56:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 18:56:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 18:56:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 18:56:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 18:56:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 18:56:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 18:56:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 18:56:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 18:56:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 18:56:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 18:56:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 18:56:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 18:56:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 18:56:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 18:56:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 18:56:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 18:56:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 18:56:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 18:56:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 18:56:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 18:56:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 18:56:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 18:56:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 18:56:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 18:56:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 18:56:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 18:56:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 18:56:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 18:56:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 18:56:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 18:56:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 18:56:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 18:56:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 18:56:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 18:56:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 18:56:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 18:56:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 18:56:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 18:56:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 18:56:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 18:56:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 18:56:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 18:56:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 18:56:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 18:56:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 18:56:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 18:56:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 18:56:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 18:56:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 18:56:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 18:56:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 18:56:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 18:56:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 18:56:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 18:56:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 18:56:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 18:56:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 18:56:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 18:56:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 18:56:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 18:56:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 18:56:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 18:56:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 18:56:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 18:56:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 18:56:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 18:56:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 18:56:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 18:56:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 18:56:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 18:56:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 18:56:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 18:56:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 18:56:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 18:56:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 18:56:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 18:56:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 18:56:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 18:56:50,991 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 18:56:50,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 18:56:50,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 18:56:50,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 18:56:50,991 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 18:56:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:56:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 18:56:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 18:56:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 18:56:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 18:56:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 18:56:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 18:56:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:56:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 18:56:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 18:56:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 18:56:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 18:56:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 18:56:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 18:56:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 18:56:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 18:56:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 18:56:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 18:56:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 18:56:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 18:56:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 18:56:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 18:56:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 18:56:50,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 18:56:51,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 18:56:51,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:56:51,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 18:56:51,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:56:51,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:56:51,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 18:56:51,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 18:56:51,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 18:56:51,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 18:56:51,865 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:56:52,231 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:56:52,574 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:56:52,575 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 18:56:52,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:56:52 BoogieIcfgContainer [2019-11-27 18:56:52,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:56:52,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:56:52,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:56:52,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:56:52,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:56:49" (1/3) ... [2019-11-27 18:56:52,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b41f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:56:52, skipping insertion in model container [2019-11-27 18:56:52,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:56:50" (2/3) ... [2019-11-27 18:56:52,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b41f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:56:52, skipping insertion in model container [2019-11-27 18:56:52,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:56:52" (3/3) ... [2019-11-27 18:56:52,587 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2019-11-27 18:56:52,597 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:56:52,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 18:56:52,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 18:56:52,642 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:56:52,642 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 18:56:52,643 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:56:52,643 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:56:52,643 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:56:52,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:56:52,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:56:52,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:56:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-11-27 18:56:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:56:52,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:52,684 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:56:52,685 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:56:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash -580210168, now seen corresponding path program 1 times [2019-11-27 18:56:52,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:52,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33298835] [2019-11-27 18:56:52,706 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:56:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:52,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:56:52,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:52,976 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:56:52,977 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:56:52,987 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:56:52,988 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:56:52,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:56:53,031 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:56:53,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:53,114 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:56:53,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33298835] [2019-11-27 18:56:53,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:53,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 18:56:53,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110195935] [2019-11-27 18:56:53,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:56:53,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:56:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:56:53,164 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-11-27 18:56:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:53,513 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-27 18:56:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:56:53,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:56:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:53,557 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:56:53,559 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:56:53,563 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:56:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:56:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2019-11-27 18:56:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-27 18:56:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-11-27 18:56:53,646 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 17 [2019-11-27 18:56:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:53,647 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-11-27 18:56:53,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:56:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-11-27 18:56:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:56:53,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:53,648 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:56:53,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:56:53,861 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:56:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash -580210167, now seen corresponding path program 1 times [2019-11-27 18:56:53,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:53,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432504712] [2019-11-27 18:56:53,864 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:56:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:53,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:56:54,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:54,015 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:56:54,016 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:56:54,022 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:56:54,023 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:56:54,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:56:54,074 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:56:54,074 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:54,399 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:56:54,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432504712] [2019-11-27 18:56:54,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:54,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 18:56:54,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62825686] [2019-11-27 18:56:54,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:56:54,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:56:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:56:54,403 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 10 states. [2019-11-27 18:56:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:55,048 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-11-27 18:56:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:56:55,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 18:56:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:55,053 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:56:55,053 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:56:55,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:56:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:56:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-11-27 18:56:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-27 18:56:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2019-11-27 18:56:55,066 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 17 [2019-11-27 18:56:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:55,067 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2019-11-27 18:56:55,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:56:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2019-11-27 18:56:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:56:55,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:55,068 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:56:55,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:56:55,276 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:56:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash -551581017, now seen corresponding path program 1 times [2019-11-27 18:56:55,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:55,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923204238] [2019-11-27 18:56:55,279 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:56:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:55,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:56:55,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:55,434 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:56:55,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:55,474 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:56:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923204238] [2019-11-27 18:56:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:56:55,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929768816] [2019-11-27 18:56:55,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:56:55,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:56:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:56:55,477 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2019-11-27 18:56:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:55,504 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2019-11-27 18:56:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:56:55,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:56:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:55,507 INFO L225 Difference]: With dead ends: 146 [2019-11-27 18:56:55,507 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:56:55,508 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:56:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:56:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-27 18:56:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 18:56:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-27 18:56:55,519 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 17 [2019-11-27 18:56:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:55,520 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-27 18:56:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:56:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-27 18:56:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 18:56:55,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:55,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] [2019-11-27 18:56:55,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:56:55,734 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:56:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash 180429038, now seen corresponding path program 1 times [2019-11-27 18:56:55,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:55,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575140226] [2019-11-27 18:56:55,737 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:56:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:55,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:56:55,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:55,889 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:56:55,889 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:55,961 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:56:55,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575140226] [2019-11-27 18:56:55,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:55,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:56:55,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584372511] [2019-11-27 18:56:55,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:56:55,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:55,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:56:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:56:55,963 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 5 states. [2019-11-27 18:56:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:55,991 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-27 18:56:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:56:55,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-27 18:56:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:55,994 INFO L225 Difference]: With dead ends: 146 [2019-11-27 18:56:55,994 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:56:55,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:56:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:56:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-27 18:56:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 18:56:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2019-11-27 18:56:56,006 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 27 [2019-11-27 18:56:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:56,007 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2019-11-27 18:56:56,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:56:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2019-11-27 18:56:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 18:56:56,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:56,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:56:56,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:56:56,230 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:56:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash -330105139, now seen corresponding path program 1 times [2019-11-27 18:56:56,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:56,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094161200] [2019-11-27 18:56:56,232 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:56:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:56,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:56:56,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:56,428 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:56:56,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:56,474 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:56:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094161200] [2019-11-27 18:56:56,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:56,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 18:56:56,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422098589] [2019-11-27 18:56:56,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:56:56,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:56:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:56:56,480 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 7 states. [2019-11-27 18:56:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:56,552 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-11-27 18:56:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:56:56,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-27 18:56:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:56,557 INFO L225 Difference]: With dead ends: 160 [2019-11-27 18:56:56,557 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 18:56:56,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:56:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 18:56:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2019-11-27 18:56:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-27 18:56:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2019-11-27 18:56:56,583 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 27 [2019-11-27 18:56:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:56,583 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2019-11-27 18:56:56,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:56:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2019-11-27 18:56:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:56:56,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:56,587 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:56:56,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 18:56:56,800 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:56:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 317366699, now seen corresponding path program 1 times [2019-11-27 18:56:56,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:56,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994411814] [2019-11-27 18:56:56,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 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:56:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:56,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 18:56:56,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:56,973 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:56:56,975 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:57,038 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:56:57,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994411814] [2019-11-27 18:56:57,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:57,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 18:56:57,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446742936] [2019-11-27 18:56:57,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:56:57,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:56:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:56:57,043 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2019-11-27 18:56:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:57,096 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2019-11-27 18:56:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:56:57,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 18:56:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:57,099 INFO L225 Difference]: With dead ends: 159 [2019-11-27 18:56:57,099 INFO L226 Difference]: Without dead ends: 155 [2019-11-27 18:56:57,100 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:56:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-27 18:56:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-27 18:56:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 18:56:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2019-11-27 18:56:57,124 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 32 [2019-11-27 18:56:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:57,124 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2019-11-27 18:56:57,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:56:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2019-11-27 18:56:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 18:56:57,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:57,129 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:56:57,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 18:56:57,341 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:56:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1135828661, now seen corresponding path program 1 times [2019-11-27 18:56:57,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:57,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111544756] [2019-11-27 18:56:57,342 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:56:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:57,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:56:57,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:57,521 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:56:57,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:57,667 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:56:57,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111544756] [2019-11-27 18:56:57,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:56:57,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:56:57,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300223491] [2019-11-27 18:56:57,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:56:57,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:56:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:56:57,670 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 10 states. [2019-11-27 18:56:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:57,916 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2019-11-27 18:56:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:56:57,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 18:56:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:57,918 INFO L225 Difference]: With dead ends: 163 [2019-11-27 18:56:57,919 INFO L226 Difference]: Without dead ends: 159 [2019-11-27 18:56:57,919 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:56:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-27 18:56:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-11-27 18:56:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-27 18:56:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2019-11-27 18:56:57,928 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 34 [2019-11-27 18:56:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:57,929 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2019-11-27 18:56:57,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:56:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2019-11-27 18:56:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 18:56:57,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:57,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:56:58,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 18:56:58,151 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:56:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 591246760, now seen corresponding path program 1 times [2019-11-27 18:56:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:58,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480584756] [2019-11-27 18:56:58,153 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:56:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:58,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:56:58,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:58,392 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:56:58,393 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:58,466 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:56:58,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480584756] [2019-11-27 18:56:58,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:58,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 18:56:58,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279081109] [2019-11-27 18:56:58,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:56:58,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:56:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:56:58,468 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 7 states. [2019-11-27 18:56:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:58,538 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2019-11-27 18:56:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:56:58,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-27 18:56:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:58,541 INFO L225 Difference]: With dead ends: 169 [2019-11-27 18:56:58,541 INFO L226 Difference]: Without dead ends: 169 [2019-11-27 18:56:58,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:56:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-27 18:56:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-11-27 18:56:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-27 18:56:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2019-11-27 18:56:58,554 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 36 [2019-11-27 18:56:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:58,554 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2019-11-27 18:56:58,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:56:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2019-11-27 18:56:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 18:56:58,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:58,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:56:58,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 18:56:58,785 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:56:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash -212953728, now seen corresponding path program 1 times [2019-11-27 18:56:58,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:58,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329533118] [2019-11-27 18:56:58,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 18:56:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:56:58,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:56:58,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:58,924 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:56:58,924 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:59,052 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:56:59,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329533118] [2019-11-27 18:56:59,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:59,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:56:59,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654799156] [2019-11-27 18:56:59,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 18:56:59,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 18:56:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:56:59,054 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 3 states. [2019-11-27 18:56:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:56:59,233 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2019-11-27 18:56:59,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 18:56:59,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-27 18:56:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:56:59,236 INFO L225 Difference]: With dead ends: 176 [2019-11-27 18:56:59,236 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 18:56:59,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:56:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 18:56:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-11-27 18:56:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 18:56:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2019-11-27 18:56:59,245 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 34 [2019-11-27 18:56:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:56:59,245 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2019-11-27 18:56:59,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 18:56:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2019-11-27 18:56:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:56:59,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:56:59,247 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:56:59,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 18:56:59,466 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:56:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:56:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345269, now seen corresponding path program 2 times [2019-11-27 18:56:59,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:56:59,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556518649] [2019-11-27 18:56:59,468 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 18:56:59,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:56:59,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:56:59,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:56:59,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:56:59,608 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:56:59,608 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:56:59,610 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:56:59,610 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:56:59,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:56:59,772 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:56:59,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:56:59,854 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:56:59,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556518649] [2019-11-27 18:56:59,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:56:59,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:56:59,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336146465] [2019-11-27 18:56:59,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:56:59,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:56:59,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:56:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:56:59,856 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2019-11-27 18:57:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:00,870 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-11-27 18:57:00,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:57:00,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 18:57:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:00,872 INFO L225 Difference]: With dead ends: 157 [2019-11-27 18:57:00,872 INFO L226 Difference]: Without dead ends: 157 [2019-11-27 18:57:00,873 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:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-27 18:57:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2019-11-27 18:57:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-27 18:57:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2019-11-27 18:57:00,879 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 38 [2019-11-27 18:57:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:00,882 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2019-11-27 18:57:00,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:57:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2019-11-27 18:57:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:57:00,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:00,884 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:01,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 18:57:01,087 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:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345268, now seen corresponding path program 1 times [2019-11-27 18:57:01,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:01,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733670980] [2019-11-27 18:57:01,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:01,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:57:01,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:01,320 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:01,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:01,667 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:01,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733670980] [2019-11-27 18:57:01,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:57:01,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 18:57:01,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573420355] [2019-11-27 18:57:01,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:57:01,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:57:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:57:01,670 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 18 states. [2019-11-27 18:57:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:02,545 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-27 18:57:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:57:02,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 18:57:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:02,547 INFO L225 Difference]: With dead ends: 157 [2019-11-27 18:57:02,548 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:57:02,548 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:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:57:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-27 18:57:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-27 18:57:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-27 18:57:02,554 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 38 [2019-11-27 18:57:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:02,555 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-27 18:57:02,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:57:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-27 18:57:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 18:57:02,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:02,557 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:02,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 18:57:02,761 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:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1038685964, now seen corresponding path program 2 times [2019-11-27 18:57:02,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:02,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806059597] [2019-11-27 18:57:02,763 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:02,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:57:02,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:57:02,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:57:02,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:02,943 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:02,944 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:02,955 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:02,956 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:02,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:03,201 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:03,201 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:04,075 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:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806059597] [2019-11-27 18:57:04,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:04,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:57:04,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106666936] [2019-11-27 18:57:04,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:57:04,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:57:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:57:04,077 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-27 18:57:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:06,823 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-11-27 18:57:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:57:06,824 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 18:57:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:06,825 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:57:06,826 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:57:06,826 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:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:57:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-27 18:57:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 18:57:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-27 18:57:06,832 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 46 [2019-11-27 18:57:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-27 18:57:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:57:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-27 18:57:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 18:57:06,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:06,833 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:07,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 18:57:07,044 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:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1614588820, now seen corresponding path program 1 times [2019-11-27 18:57:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028422873] [2019-11-27 18:57:07,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:07,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 18:57:07,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:07,420 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:07,420 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:07,530 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 18:57:08,386 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:08,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028422873] [2019-11-27 18:57:08,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:57:08,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 18:57:08,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107671454] [2019-11-27 18:57:08,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 18:57:08,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 18:57:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 18:57:08,389 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 34 states. [2019-11-27 18:57:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:09,145 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2019-11-27 18:57:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:57:09,146 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 18:57:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:09,148 INFO L225 Difference]: With dead ends: 158 [2019-11-27 18:57:09,148 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 18:57:09,149 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:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 18:57:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 18:57:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 18:57:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-27 18:57:09,161 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 51 [2019-11-27 18:57:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:09,162 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-27 18:57:09,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 18:57:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-27 18:57:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:57:09,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:09,163 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:09,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 18:57:09,375 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:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1256867828, now seen corresponding path program 2 times [2019-11-27 18:57:09,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:09,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585767567] [2019-11-27 18:57:09,378 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:09,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:57:09,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:57:09,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:57:09,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:09,537 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:09,537 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:09,539 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:09,539 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:09,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:09,709 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:09,710 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:09,809 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:09,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585767567] [2019-11-27 18:57:09,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:09,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:57:09,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730652590] [2019-11-27 18:57:09,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:57:09,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:57:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:57:09,812 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 12 states. [2019-11-27 18:57:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:10,687 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-27 18:57:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:57:10,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 18:57:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:10,689 INFO L225 Difference]: With dead ends: 164 [2019-11-27 18:57:10,689 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 18:57:10,690 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:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 18:57:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-27 18:57:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 18:57:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-27 18:57:10,695 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 53 [2019-11-27 18:57:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:10,695 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-27 18:57:10,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:57:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-27 18:57:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:57:10,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:10,697 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:10,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 18:57:10,908 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:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1256867829, now seen corresponding path program 1 times [2019-11-27 18:57:10,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:10,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301221632] [2019-11-27 18:57:10,910 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:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:11,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:57:11,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:11,111 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:11,111 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:11,116 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:11,117 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:11,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:11,341 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:11,341 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:12,151 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:12,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301221632] [2019-11-27 18:57:12,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:12,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:57:12,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022671022] [2019-11-27 18:57:12,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:57:12,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:12,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:57:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:57:12,155 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 23 states. [2019-11-27 18:57:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:14,753 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-11-27 18:57:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:57:14,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 18:57:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:14,755 INFO L225 Difference]: With dead ends: 150 [2019-11-27 18:57:14,755 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:57:14,756 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:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:57:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 18:57:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 18:57:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2019-11-27 18:57:14,761 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 53 [2019-11-27 18:57:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:14,761 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2019-11-27 18:57:14,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:57:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2019-11-27 18:57:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-27 18:57:14,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:14,763 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:14,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 18:57:14,973 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:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1782492395, now seen corresponding path program 1 times [2019-11-27 18:57:14,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:14,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122891450] [2019-11-27 18:57:14,975 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:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:15,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:57:15,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:15,178 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:15,178 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:15,327 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:15,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122891450] [2019-11-27 18:57:15,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:15,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 18:57:15,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470138347] [2019-11-27 18:57:15,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:57:15,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:57:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:57:15,330 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 8 states. [2019-11-27 18:57:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:15,375 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2019-11-27 18:57:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:57:15,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-27 18:57:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:15,378 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:57:15,378 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:57:15,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 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:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:57:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 18:57:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 18:57:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2019-11-27 18:57:15,384 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 56 [2019-11-27 18:57:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:15,385 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2019-11-27 18:57:15,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:57:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2019-11-27 18:57:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-27 18:57:15,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:15,387 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] [2019-11-27 18:57:15,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 18:57:15,599 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:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1924935738, now seen corresponding path program 1 times [2019-11-27 18:57:15,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:15,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308754800] [2019-11-27 18:57:15,601 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:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:15,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:57:15,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:15,840 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:15,840 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:57:16,108 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:16,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308754800] [2019-11-27 18:57:16,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:16,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 18:57:16,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741329152] [2019-11-27 18:57:16,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:57:16,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:57:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:57:16,111 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 11 states. [2019-11-27 18:57:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:16,235 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2019-11-27 18:57:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:57:16,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-11-27 18:57:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:16,237 INFO L225 Difference]: With dead ends: 154 [2019-11-27 18:57:16,237 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:57:16,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 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:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:57:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 18:57:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 18:57:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-27 18:57:16,243 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 61 [2019-11-27 18:57:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:16,243 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-27 18:57:16,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:57:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-27 18:57:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-27 18:57:16,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:16,245 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] [2019-11-27 18:57:16,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 18:57:16,446 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:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1553235633, now seen corresponding path program 1 times [2019-11-27 18:57:16,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:16,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026549311] [2019-11-27 18:57:16,446 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:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:16,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 18:57:16,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:16,715 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:16,715 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:16,718 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:16,718 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:16,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:16,903 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:16,903 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:17,087 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:17,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026549311] [2019-11-27 18:57:17,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:17,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 14 [2019-11-27 18:57:17,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921193872] [2019-11-27 18:57:17,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 18:57:17,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 18:57:17,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:57:17,088 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 15 states. [2019-11-27 18:57:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:18,203 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-11-27 18:57:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 18:57:18,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-11-27 18:57:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:18,205 INFO L225 Difference]: With dead ends: 160 [2019-11-27 18:57:18,205 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 18:57:18,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-27 18:57:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 18:57:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2019-11-27 18:57:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 18:57:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2019-11-27 18:57:18,213 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 72 [2019-11-27 18:57:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:18,213 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2019-11-27 18:57:18,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 18:57:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2019-11-27 18:57:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-27 18:57:18,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:18,214 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] [2019-11-27 18:57:18,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 18:57:18,416 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:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1553235634, now seen corresponding path program 1 times [2019-11-27 18:57:18,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:18,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524228041] [2019-11-27 18:57:18,417 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:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:18,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 18:57:18,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:18,760 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:18,760 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:18,766 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:18,766 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:18,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:19,113 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:19,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:20,840 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:20,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524228041] [2019-11-27 18:57:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2019-11-27 18:57:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905956524] [2019-11-27 18:57:20,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-27 18:57:20,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-27 18:57:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-11-27 18:57:20,843 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 29 states. [2019-11-27 18:57:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:24,652 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-11-27 18:57:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:57:24,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2019-11-27 18:57:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:24,654 INFO L225 Difference]: With dead ends: 146 [2019-11-27 18:57:24,654 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:57:24,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 18:57:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:57:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 18:57:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 18:57:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2019-11-27 18:57:24,659 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 72 [2019-11-27 18:57:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:24,659 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2019-11-27 18:57:24,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-27 18:57:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2019-11-27 18:57:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-27 18:57:24,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:24,661 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] [2019-11-27 18:57:24,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 18:57:24,872 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:57:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1822676548, now seen corresponding path program 1 times [2019-11-27 18:57:24,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:24,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756323325] [2019-11-27 18:57:24,874 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:57:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:25,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:57:25,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:25,169 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:25,169 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:25,333 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:25,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756323325] [2019-11-27 18:57:25,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:25,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-27 18:57:25,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682408251] [2019-11-27 18:57:25,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:57:25,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:57:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:57:25,336 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 11 states. [2019-11-27 18:57:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:25,421 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2019-11-27 18:57:25,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:57:25,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-11-27 18:57:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:25,424 INFO L225 Difference]: With dead ends: 149 [2019-11-27 18:57:25,424 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:57:25,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 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:57:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:57:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 18:57:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 18:57:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-27 18:57:25,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 81 [2019-11-27 18:57:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:25,431 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-27 18:57:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:57:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-27 18:57:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-27 18:57:25,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:25,432 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:25,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 18:57:25,634 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:57:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1759296345, now seen corresponding path program 1 times [2019-11-27 18:57:25,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:25,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067462979] [2019-11-27 18:57:25,636 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:57:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:25,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 18:57:25,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:25,913 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:25,914 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:25,919 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:25,920 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:25,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:26,169 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:26,169 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:26,402 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:26,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067462979] [2019-11-27 18:57:26,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:26,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 18:57:26,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797589739] [2019-11-27 18:57:26,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 18:57:26,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 18:57:26,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:57:26,408 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 17 states. [2019-11-27 18:57:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:27,724 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-11-27 18:57:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:57:27,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2019-11-27 18:57:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:27,726 INFO L225 Difference]: With dead ends: 160 [2019-11-27 18:57:27,726 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 18:57:27,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 165 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 18:57:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 18:57:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2019-11-27 18:57:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 18:57:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2019-11-27 18:57:27,731 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 94 [2019-11-27 18:57:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:27,731 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2019-11-27 18:57:27,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 18:57:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2019-11-27 18:57:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-27 18:57:27,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:27,733 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:27,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 18:57:27,944 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:57:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1759296346, now seen corresponding path program 1 times [2019-11-27 18:57:27,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:27,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776285214] [2019-11-27 18:57:27,947 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:57:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:28,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 18:57:28,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:28,233 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,234 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:28,240 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:28,240 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,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:28,652 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:28,652 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:30,444 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:30,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776285214] [2019-11-27 18:57:30,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 18:57:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512283491] [2019-11-27 18:57:30,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 18:57:30,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 18:57:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 18:57:30,446 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 33 states. [2019-11-27 18:57:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:34,503 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-11-27 18:57:34,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:57:34,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-11-27 18:57:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:34,507 INFO L225 Difference]: With dead ends: 142 [2019-11-27 18:57:34,507 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 18:57:34,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 18:57:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 18:57:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-27 18:57:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-27 18:57:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-11-27 18:57:34,511 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 94 [2019-11-27 18:57:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:34,512 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-11-27 18:57:34,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 18:57:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-11-27 18:57:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 18:57:34,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:34,514 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] [2019-11-27 18:57:34,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 18:57:34,724 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:57:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash -207269007, now seen corresponding path program 1 times [2019-11-27 18:57:34,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:34,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284386484] [2019-11-27 18:57:34,726 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:57:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:34,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:57:34,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:35,041 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:35,041 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:35,312 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:35,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284386484] [2019-11-27 18:57:35,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:35,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-27 18:57:35,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699217298] [2019-11-27 18:57:35,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:57:35,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:35,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:57:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:57:35,314 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 11 states. [2019-11-27 18:57:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:35,405 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-11-27 18:57:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:57:35,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-11-27 18:57:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:35,407 INFO L225 Difference]: With dead ends: 144 [2019-11-27 18:57:35,407 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 18:57:35,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 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:57:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 18:57:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-27 18:57:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-27 18:57:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-27 18:57:35,413 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 92 [2019-11-27 18:57:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:35,413 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-27 18:57:35,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:57:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-27 18:57:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-27 18:57:35,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:35,415 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:35,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 18:57:35,625 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -889618677, now seen corresponding path program 1 times [2019-11-27 18:57:35,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:35,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225374574] [2019-11-27 18:57:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:35,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 18:57:35,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:36,000 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:36,000 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:36,002 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:36,002 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:36,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:57:36,494 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:36,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:36,748 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:36,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225374574] [2019-11-27 18:57:36,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:36,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-27 18:57:36,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6809717] [2019-11-27 18:57:36,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 18:57:36,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 18:57:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:57:36,753 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 21 states. [2019-11-27 18:57:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:38,381 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-11-27 18:57:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:57:38,382 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-11-27 18:57:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:38,383 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:57:38,383 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:57:38,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-27 18:57:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:57:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2019-11-27 18:57:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-27 18:57:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-11-27 18:57:38,388 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 107 [2019-11-27 18:57:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:38,389 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-11-27 18:57:38,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 18:57:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-11-27 18:57:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-27 18:57:38,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:38,390 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:38,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-27 18:57:38,594 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -889618676, now seen corresponding path program 1 times [2019-11-27 18:57:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:38,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737883215] [2019-11-27 18:57:38,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 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:38,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-27 18:57:38,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:38,922 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:38,923 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:38,929 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:38,930 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:38,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:57:39,753 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:39,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:42,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:42,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737883215] [2019-11-27 18:57:42,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:42,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-27 18:57:42,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168031272] [2019-11-27 18:57:42,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-27 18:57:42,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-27 18:57:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 18:57:42,176 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 41 states. [2019-11-27 18:57:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:47,468 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-11-27 18:57:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:57:47,469 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 107 [2019-11-27 18:57:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:47,471 INFO L225 Difference]: With dead ends: 138 [2019-11-27 18:57:47,471 INFO L226 Difference]: Without dead ends: 138 [2019-11-27 18:57:47,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 166 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-27 18:57:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-27 18:57:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-27 18:57:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-27 18:57:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-11-27 18:57:47,476 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 107 [2019-11-27 18:57:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:47,477 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-11-27 18:57:47,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-27 18:57:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-11-27 18:57:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-27 18:57:47,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:47,478 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:47,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-27 18:57:47,690 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1613444290, now seen corresponding path program 1 times [2019-11-27 18:57:47,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:47,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39535959] [2019-11-27 18:57:47,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:48,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:57:48,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:48,993 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:48,993 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:57:49,816 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,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39535959] [2019-11-27 18:57:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:57:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-27 18:57:49,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461615869] [2019-11-27 18:57:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-27 18:57:49,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:57:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-27 18:57:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 18:57:49,818 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 40 states. [2019-11-27 18:57:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:57:52,485 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-11-27 18:57:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:57:52,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 110 [2019-11-27 18:57:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:57:52,487 INFO L225 Difference]: With dead ends: 137 [2019-11-27 18:57:52,487 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 18:57:52,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-27 18:57:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 18:57:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-27 18:57:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-27 18:57:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2019-11-27 18:57:52,491 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 110 [2019-11-27 18:57:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:57:52,492 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2019-11-27 18:57:52,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-27 18:57:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2019-11-27 18:57:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-27 18:57:52,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:57:52,493 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:57:52,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-27 18:57:52,702 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:57:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:57:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1140166607, now seen corresponding path program 1 times [2019-11-27 18:57:52,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:57:52,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462346017] [2019-11-27 18:57:52,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-27 18:57:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:57:53,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 18:57:53,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:57:53,291 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:57:53,291 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,299 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:53,300 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 18:57:53,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:57:53,365 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:57:53,366 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,400 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-27 18:57:53,401 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:57:53,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 18:58:05,824 WARN L192 SmtUtils]: Spent 12.35 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-27 18:58:05,825 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-27 18:58:05,825 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:05,826 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:05,880 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-27 18:58:05,881 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:05,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 18:58:06,015 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 18:58:06,015 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:06,016 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:06,035 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:06,035 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:06,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 18:58:06,869 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:06,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:07,313 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:58:08,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:09,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:11,626 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:58:11,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:58:11,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:58:11,871 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 18:58:11,872 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 18:58:11,872 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:11,888 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 18:58:11,888 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:11,889 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:11,890 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:11,890 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:11,891 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:11,891 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:11,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 18:58:13,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:58:13,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:58:14,248 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 18:58:14,250 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 18:58:14,250 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:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,512 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 18:58:14,513 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 18:58:14,513 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:14,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:14,528 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:14,751 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-27 18:58:14,751 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-27 18:58:14,752 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:14,793 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-27 18:58:14,793 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:14,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-27 18:58:16,272 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:16,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462346017] [2019-11-27 18:58:16,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:16,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 18:58:16,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333526239] [2019-11-27 18:58:16,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 18:58:16,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 18:58:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 18:58:16,275 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 55 states. [2019-11-27 18:58:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:21,892 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 18:58:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 18:58:21,892 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 113 [2019-11-27 18:58:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:21,893 INFO L225 Difference]: With dead ends: 60 [2019-11-27 18:58:21,893 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 18:58:21,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 18:58:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 18:58:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 18:58:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 18:58:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 18:58:21,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2019-11-27 18:58:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:21,895 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 18:58:21,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 18:58:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 18:58:21,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 18:58:22,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-27 18:58:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 06:58:22 BoogieIcfgContainer [2019-11-27 18:58:22,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 18:58:22,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 18:58:22,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 18:58:22,109 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 18:58:22,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:56:52" (3/4) ... [2019-11-27 18:58:22,113 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 18:58:22,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 18:58:22,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:22,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 18:58:22,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 18:58:22,124 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:22,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 18:58:22,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 18:58:22,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 18:58:22,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 18:58:22,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 18:58:22,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 18:58:22,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 18:58:22,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 18:58:22,131 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 18:58:22,149 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2019-11-27 18:58:22,149 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-27 18:58:22,150 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 18:58:22,150 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 18:58:22,151 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 18:58:22,205 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 18:58:22,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 18:58:22,207 INFO L168 Benchmark]: Toolchain (without parser) took 92306.49 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 536.9 MB). Free memory was 949.6 MB in the beginning and 1.5 GB in the end (delta: -550.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:22,207 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:22,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:22,208 INFO L168 Benchmark]: Boogie Preprocessor took 127.46 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:22,209 INFO L168 Benchmark]: RCFGBuilder took 1683.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:22,209 INFO L168 Benchmark]: TraceAbstraction took 89529.06 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 389.5 MB). Free memory was 992.2 MB in the beginning and 1.5 GB in the end (delta: -521.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:22,209 INFO L168 Benchmark]: Witness Printer took 97.35 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:22,211 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 863.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.46 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 1683.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89529.06 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 389.5 MB). Free memory was 992.2 MB in the beginning and 1.5 GB in the end (delta: -521.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 97.35 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 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, 333 locations, 71 error locations. Result: SAFE, OverallTime: 89.4s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 36.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3248 SDtfs, 1486 SDslu, 25646 SDs, 0 SdLazy, 13929 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3215 GetRequests, 2646 SyntacticMatches, 67 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 98 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 41.2s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3104 ConstructedInterpolants, 478 QuantifiedInterpolants, 1043542 SizeOfPredicates, 165 NumberOfNonLiveVariables, 6724 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...