./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.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_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ............................................................................................................................ 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_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:58:46,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:58:46,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:58:46,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:58:46,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:58:46,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:58:46,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:58:46,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:58:46,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:58:46,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:58:46,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:58:46,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:58:46,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:58:46,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:58:46,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:58:46,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:58:46,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:58:46,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:58:46,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:58:46,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:58:46,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:58:46,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:58:46,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:58:46,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:58:46,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:58:46,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:58:46,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:58:46,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:58:46,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:58:46,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:58:46,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:58:46,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:58:46,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:58:46,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:58:46,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:58:46,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:58:46,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:58:46,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:58:46,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:58:46,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:58:46,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:58:46,801 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:58:46,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:58:46,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:58:46,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:58:46,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:58:46,817 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:58:46,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:58:46,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:58:46,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:58:46,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:58:46,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:58:46,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:58:46,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:58:46,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:58:46,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:58:46,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:58:46,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:58:46,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:58:46,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:58:46,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:58:46,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:58:46,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:58:46,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:58:46,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:58:46,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:58:46,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:58:46,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:58:46,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:58:46,824 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-27 18:58:47,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:58:47,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:58:47,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:58:47,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:58:47,187 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:58:47,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 18:58:47,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ae56da/306446ed390e47b9a4371008454dfb7c/FLAGa04094328 [2019-11-27 18:58:47,745 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:58:47,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 18:58:47,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ae56da/306446ed390e47b9a4371008454dfb7c/FLAGa04094328 [2019-11-27 18:58:48,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ae56da/306446ed390e47b9a4371008454dfb7c [2019-11-27 18:58:48,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:58:48,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:58:48,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:48,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:58:48,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:58:48,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:48" (1/1) ... [2019-11-27 18:58:48,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae09888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:48, skipping insertion in model container [2019-11-27 18:58:48,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:48" (1/1) ... [2019-11-27 18:58:48,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:58:48,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:48,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:48,734 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:58:48,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f87d05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:48, skipping insertion in model container [2019-11-27 18:58:48,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:48,736 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 18:58:48,739 INFO L168 Benchmark]: Toolchain (without parser) took 710.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:48,740 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:48,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:48,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 707.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 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:58:50,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:58:50,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:58:50,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:58:50,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:58:50,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:58:50,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:58:50,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:58:50,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:58:50,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:58:50,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:58:50,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:58:50,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:58:50,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:58:50,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:58:50,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:58:50,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:58:50,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:58:50,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:58:50,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:58:50,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:58:50,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:58:50,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:58:50,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:58:50,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:58:50,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:58:50,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:58:50,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:58:50,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:58:50,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:58:50,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:58:50,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:58:50,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:58:50,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:58:50,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:58:50,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:58:50,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:58:50,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:58:50,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:58:50,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:58:50,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:58:50,606 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:58:50,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:58:50,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:58:50,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:58:50,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:58:50,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:58:50,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:58:50,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:58:50,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:58:50,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:58:50,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:58:50,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:58:50,629 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:58:50,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:58:50,629 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:58:50,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:58:50,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:58:50,630 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:58:50,630 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:58:50,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:58:50,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:58:50,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:58:50,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:58:50,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:58:50,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:58:50,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:58:50,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:58:50,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:58:50,633 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:58:50,633 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:58:50,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:58:50,633 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-27 18:58:50,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:58:50,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:58:50,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:58:50,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:58:50,982 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:58:50,984 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 18:58:51,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd549e3d/a48552e0b65344b5b84735c4d7be9362/FLAG6eed6fd75 [2019-11-27 18:58:51,617 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:58:51,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 18:58:51,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd549e3d/a48552e0b65344b5b84735c4d7be9362/FLAG6eed6fd75 [2019-11-27 18:58:51,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd549e3d/a48552e0b65344b5b84735c4d7be9362 [2019-11-27 18:58:51,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:58:51,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:58:51,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:51,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:58:51,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:58:51,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:51" (1/1) ... [2019-11-27 18:58:51,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c493f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:51, skipping insertion in model container [2019-11-27 18:58:51,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:51" (1/1) ... [2019-11-27 18:58:51,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:58:52,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:52,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:52,750 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 18:58:52,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:52,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:52,822 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:58:52,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:52,966 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:58:52,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52 WrapperNode [2019-11-27 18:58:52,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:52,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:58:52,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:58:52,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:58:52,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:52,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (1/1) ... [2019-11-27 18:58:53,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:58:53,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:58:53,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:58:53,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:58:53,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (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:58:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 18:58:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:58:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 18:58:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 18:58:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 18:58:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 18:58:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 18:58:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 18:58:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 18:58:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 18:58:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 18:58:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 18:58:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 18:58:53,165 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 18:58:53,165 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 18:58:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 18:58:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 18:58:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 18:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 18:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 18:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 18:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 18:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 18:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 18:58:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 18:58:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 18:58:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 18:58:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 18:58:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 18:58:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 18:58:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 18:58:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 18:58:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 18:58:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 18:58:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 18:58:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 18:58:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 18:58:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 18:58:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 18:58:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 18:58:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 18:58:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 18:58:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 18:58:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 18:58:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 18:58:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 18:58:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 18:58:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 18:58:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 18:58:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 18:58:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 18:58:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 18:58:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 18:58:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 18:58:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 18:58:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 18:58:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 18:58:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 18:58:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 18:58:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 18:58:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 18:58:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 18:58:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 18:58:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 18:58:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 18:58:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 18:58:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 18:58:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 18:58:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 18:58:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 18:58:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 18:58:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 18:58:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 18:58:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 18:58:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 18:58:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 18:58:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 18:58:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 18:58:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 18:58:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 18:58:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 18:58:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 18:58:53,202 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 18:58:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 18:58:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 18:58:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 18:58:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 18:58:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 18:58:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:58:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 18:58:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 18:58:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 18:58:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 18:58:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 18:58:53,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 18:58:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:58:53,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 18:58:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 18:58:53,887 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:58:54,316 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:58:54,700 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:58:54,700 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 18:58:54,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:54 BoogieIcfgContainer [2019-11-27 18:58:54,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:58:54,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:58:54,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:58:54,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:58:54,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:58:51" (1/3) ... [2019-11-27 18:58:54,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f863b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:58:54, skipping insertion in model container [2019-11-27 18:58:54,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:52" (2/3) ... [2019-11-27 18:58:54,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f863b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:58:54, skipping insertion in model container [2019-11-27 18:58:54,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:54" (3/3) ... [2019-11-27 18:58:54,711 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-11-27 18:58:54,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:58:54,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 18:58:54,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 18:58:54,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:58:54,766 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 18:58:54,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:58:54,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:58:54,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:58:54,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:58:54,767 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:58:54,767 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:58:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-27 18:58:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:54,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:54,799 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:58:54,800 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:58:54,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-27 18:58:54,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:54,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649840596] [2019-11-27 18:58:54,820 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:58:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:55,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:55,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:55,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:58:55,184 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:55,195 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:55,195 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:55,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:55,228 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:58:55,229 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:55,282 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:58:55,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649840596] [2019-11-27 18:58:55,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:55,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 18:58:55,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917371939] [2019-11-27 18:58:55,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:55,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:55,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:55,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:55,315 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-27 18:58:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:55,630 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-27 18:58:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:55,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:58:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:55,665 INFO L225 Difference]: With dead ends: 137 [2019-11-27 18:58:55,665 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 18:58:55,670 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:58:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 18:58:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-11-27 18:58:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 18:58:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2019-11-27 18:58:55,764 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 17 [2019-11-27 18:58:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:55,764 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2019-11-27 18:58:55,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2019-11-27 18:58:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:55,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:55,766 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:58:55,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:58:55,978 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:58:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-27 18:58:55,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:55,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340478704] [2019-11-27 18:58:55,981 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:58:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:56,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:58:56,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:56,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:58:56,137 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:56,145 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:56,146 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:56,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:58:56,193 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:58:56,193 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:56,530 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:58:56,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340478704] [2019-11-27 18:58:56,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:56,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 18:58:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083770070] [2019-11-27 18:58:56,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:58:56,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:56,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:58:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:58:56,536 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 10 states. [2019-11-27 18:58:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:57,188 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-27 18:58:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:58:57,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 18:58:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:57,196 INFO L225 Difference]: With dead ends: 133 [2019-11-27 18:58:57,197 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 18:58:57,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 18:58:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-11-27 18:58:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 18:58:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-27 18:58:57,222 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2019-11-27 18:58:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:57,222 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-27 18:58:57,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:58:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-27 18:58:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:57,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:57,224 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:58:57,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:58:57,436 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:58:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-27 18:58:57,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:57,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057478292] [2019-11-27 18:58:57,437 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:58:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:57,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:58:57,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:57,621 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:58:57,621 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:57,664 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:58:57,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057478292] [2019-11-27 18:58:57,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:57,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:58:57,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700396870] [2019-11-27 18:58:57,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:57,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:57,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:57,666 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 5 states. [2019-11-27 18:58:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:57,695 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-27 18:58:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:57,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:58:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:57,697 INFO L225 Difference]: With dead ends: 127 [2019-11-27 18:58:57,697 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 18:58:57,698 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:58:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 18:58:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-27 18:58:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-27 18:58:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-27 18:58:57,707 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 17 [2019-11-27 18:58:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:57,708 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-27 18:58:57,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-27 18:58:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 18:58:57,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:57,710 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] [2019-11-27 18:58:57,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:58:57,922 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:58:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash -811306797, now seen corresponding path program 1 times [2019-11-27 18:58:57,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:57,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925972673] [2019-11-27 18:58:57,925 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:58:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:58,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:58,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:58,120 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:58:58,120 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:58,202 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:58:58,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925972673] [2019-11-27 18:58:58,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:58,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:58:58,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900710749] [2019-11-27 18:58:58,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:58,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:58,205 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2019-11-27 18:58:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:58,231 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-27 18:58:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:58,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-27 18:58:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:58,234 INFO L225 Difference]: With dead ends: 127 [2019-11-27 18:58:58,234 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 18:58:58,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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:58:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 18:58:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-27 18:58:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-27 18:58:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-27 18:58:58,249 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 31 [2019-11-27 18:58:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:58,250 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-27 18:58:58,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-27 18:58:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 18:58:58,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:58,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:58,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:58:58,455 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:58:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1220131022, now seen corresponding path program 1 times [2019-11-27 18:58:58,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:58,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106270045] [2019-11-27 18:58:58,457 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:58:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:58,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 18:58:58,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:58,724 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:58:58,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:58,767 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:58:58,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106270045] [2019-11-27 18:58:58,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:58,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 18:58:58,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125873747] [2019-11-27 18:58:58,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 18:58:58,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 18:58:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:58:58,769 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-27 18:58:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:58,875 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-27 18:58:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:58:58,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-27 18:58:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:58,878 INFO L225 Difference]: With dead ends: 142 [2019-11-27 18:58:58,878 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 18:58:58,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 18:58:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-11-27 18:58:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-27 18:58:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-27 18:58:58,890 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 31 [2019-11-27 18:58:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:58,890 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-27 18:58:58,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 18:58:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-27 18:58:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:58:58,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:58,896 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:58:59,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 18:58:59,108 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:58:59,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-27 18:58:59,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:59,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915961112] [2019-11-27 18:58:59,110 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:58:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:59,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 18:58:59,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:59,247 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:58:59,247 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:59,296 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:58:59,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915961112] [2019-11-27 18:58:59,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:59,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 18:58:59,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10403926] [2019-11-27 18:58:59,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:58:59,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:58:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:58:59,298 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-27 18:58:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:59,340 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-27 18:58:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:58:59,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 18:58:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:59,342 INFO L225 Difference]: With dead ends: 144 [2019-11-27 18:58:59,342 INFO L226 Difference]: Without dead ends: 140 [2019-11-27 18:58:59,343 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:58:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-27 18:58:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-27 18:58:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-27 18:58:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-11-27 18:58:59,351 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2019-11-27 18:58:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:59,352 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-11-27 18:58:59,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:58:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-11-27 18:58:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 18:58:59,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:59,353 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:58:59,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 18:58:59,565 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:58:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-27 18:58:59,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:59,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967964827] [2019-11-27 18:58:59,566 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:58:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:59,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:59,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:59,756 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:58:59,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:59,898 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:58:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967964827] [2019-11-27 18:58:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:58:59,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671221248] [2019-11-27 18:58:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:58:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:58:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:58:59,901 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 10 states. [2019-11-27 18:59:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:00,132 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-11-27 18:59:00,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:59:00,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 18:59:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:00,134 INFO L225 Difference]: With dead ends: 148 [2019-11-27 18:59:00,134 INFO L226 Difference]: Without dead ends: 144 [2019-11-27 18:59:00,135 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:59:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-27 18:59:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-27 18:59:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 18:59:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-27 18:59:00,143 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2019-11-27 18:59:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-27 18:59:00,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:59:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-27 18:59:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 18:59:00,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:00,145 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:00,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 18:59:00,352 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:59:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 780110635, now seen corresponding path program 1 times [2019-11-27 18:59:00,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:00,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124484223] [2019-11-27 18:59:00,355 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:59:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:00,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 18:59:00,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 18:59:00,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 18:59:00,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124484223] [2019-11-27 18:59:00,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:00,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:59:00,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868098191] [2019-11-27 18:59:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 18:59:00,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 18:59:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:59:00,767 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 3 states. [2019-11-27 18:59:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:00,961 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-11-27 18:59:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 18:59:00,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 18:59:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:00,962 INFO L225 Difference]: With dead ends: 157 [2019-11-27 18:59:00,963 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 18:59:00,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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:59:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 18:59:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-11-27 18:59:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 18:59:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-27 18:59:00,971 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2019-11-27 18:59:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:00,974 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-27 18:59:00,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 18:59:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-27 18:59:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:59:00,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:00,983 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:59:01,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 18:59:01,203 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:59:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-27 18:59:01,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:01,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224094490] [2019-11-27 18:59:01,205 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:01,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:59:01,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:59:01,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:59:01,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:01,364 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:59:01,365 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:01,367 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:01,367 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:01,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:01,541 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:59:01,546 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:01,624 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:59:01,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224094490] [2019-11-27 18:59:01,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:01,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:59:01,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572639062] [2019-11-27 18:59:01,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:59:01,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:59:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:59:01,626 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 12 states. [2019-11-27 18:59:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:02,567 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-27 18:59:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:59:02,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 18:59:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:02,570 INFO L225 Difference]: With dead ends: 152 [2019-11-27 18:59:02,570 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 18:59:02,570 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:59:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 18:59:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-11-27 18:59:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-27 18:59:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-11-27 18:59:02,583 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 38 [2019-11-27 18:59:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:02,584 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-11-27 18:59:02,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:59:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-11-27 18:59:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:59:02,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:02,586 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:59:02,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 18:59:02,807 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:59:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:02,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-27 18:59:02,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:02,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745505539] [2019-11-27 18:59:02,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:02,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:59:02,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:03,062 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:59:03,062 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:03,416 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:59:03,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745505539] [2019-11-27 18:59:03,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:03,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 18:59:03,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612971681] [2019-11-27 18:59:03,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:59:03,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:59:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:59:03,418 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2019-11-27 18:59:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:04,292 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-27 18:59:04,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:59:04,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 18:59:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:04,295 INFO L225 Difference]: With dead ends: 138 [2019-11-27 18:59:04,295 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 18:59:04,296 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:59:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 18:59:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-27 18:59:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-27 18:59:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2019-11-27 18:59:04,302 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 38 [2019-11-27 18:59:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:04,303 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2019-11-27 18:59:04,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:59:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2019-11-27 18:59:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 18:59:04,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:04,304 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:59:04,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 18:59:04,522 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:59:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-27 18:59:04,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:04,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200026034] [2019-11-27 18:59:04,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:04,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:59:04,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:59:04,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:59:04,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:04,697 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:59:04,698 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:04,705 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:04,705 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:04,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:04,961 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:59:04,961 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:05,779 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:59:05,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200026034] [2019-11-27 18:59:05,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:05,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:59:05,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911791157] [2019-11-27 18:59:05,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:59:05,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:59:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:59:05,782 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 23 states. [2019-11-27 18:59:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:08,263 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-11-27 18:59:08,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:59:08,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 18:59:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:08,265 INFO L225 Difference]: With dead ends: 133 [2019-11-27 18:59:08,266 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 18:59:08,266 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:59:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 18:59:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-27 18:59:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-27 18:59:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-27 18:59:08,271 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 46 [2019-11-27 18:59:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:08,272 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-27 18:59:08,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:59:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-27 18:59:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 18:59:08,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:08,273 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:59:08,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 18:59:08,484 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:59:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-27 18:59:08,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:08,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732229446] [2019-11-27 18:59:08,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:08,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 18:59:08,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:08,886 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:59:08,886 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:09,005 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 18:59:09,900 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:59:09,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732229446] [2019-11-27 18:59:09,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:09,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 18:59:09,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236389904] [2019-11-27 18:59:09,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 18:59:09,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:09,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 18:59:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 18:59:09,903 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 34 states. [2019-11-27 18:59:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:10,707 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-27 18:59:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:59:10,709 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 18:59:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:10,711 INFO L225 Difference]: With dead ends: 139 [2019-11-27 18:59:10,711 INFO L226 Difference]: Without dead ends: 135 [2019-11-27 18:59:10,713 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:59:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-27 18:59:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-27 18:59:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-27 18:59:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-27 18:59:10,723 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 51 [2019-11-27 18:59:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:10,723 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-27 18:59:10,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 18:59:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-27 18:59:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:59:10,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:10,725 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:59:10,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 18:59:10,931 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:59:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-27 18:59:10,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:10,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776185243] [2019-11-27 18:59:10,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:11,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:59:11,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:59:11,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:59:11,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:11,088 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:59:11,089 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:11,096 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:11,096 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:11,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:11,261 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:59:11,262 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:11,373 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:59:11,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776185243] [2019-11-27 18:59:11,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:11,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:59:11,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212617104] [2019-11-27 18:59:11,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:59:11,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:59:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:59:11,374 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 12 states. [2019-11-27 18:59:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:12,228 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-11-27 18:59:12,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:59:12,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 18:59:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:12,231 INFO L225 Difference]: With dead ends: 159 [2019-11-27 18:59:12,231 INFO L226 Difference]: Without dead ends: 159 [2019-11-27 18:59:12,232 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:59:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-27 18:59:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2019-11-27 18:59:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-27 18:59:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-27 18:59:12,238 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2019-11-27 18:59:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:12,239 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-27 18:59:12,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:59:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-27 18:59:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:59:12,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:12,240 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:59:12,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 18:59:12,452 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:59:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-27 18:59:12,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:12,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924470265] [2019-11-27 18:59:12,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:12,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:59:12,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:12,650 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:59:12,651 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:12,658 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:12,658 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:12,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:12,885 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:59:12,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:13,706 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:59:13,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924470265] [2019-11-27 18:59:13,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:13,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:59:13,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771294235] [2019-11-27 18:59:13,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:59:13,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:59:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:59:13,709 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 23 states. [2019-11-27 18:59:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:15,854 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-11-27 18:59:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:59:15,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 18:59:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:15,857 INFO L225 Difference]: With dead ends: 131 [2019-11-27 18:59:15,857 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 18:59:15,858 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:59:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 18:59:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 18:59:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 18:59:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-27 18:59:15,864 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 53 [2019-11-27 18:59:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:15,864 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-27 18:59:15,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:59:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-27 18:59:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-27 18:59:15,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:15,866 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] [2019-11-27 18:59:16,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 18:59:16,078 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:59:16,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1848313328, now seen corresponding path program 1 times [2019-11-27 18:59:16,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:16,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664292303] [2019-11-27 18:59:16,080 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:59:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:16,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:59:16,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:16,299 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:59:16,299 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:16,455 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:59:16,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664292303] [2019-11-27 18:59:16,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:16,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 18:59:16,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352050398] [2019-11-27 18:59:16,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:59:16,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:59:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:59:16,457 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 8 states. [2019-11-27 18:59:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:16,516 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-27 18:59:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:59:16,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-27 18:59:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:16,518 INFO L225 Difference]: With dead ends: 133 [2019-11-27 18:59:16,518 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 18:59:16,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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:59:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 18:59:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 18:59:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 18:59:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-27 18:59:16,524 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 60 [2019-11-27 18:59:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:16,524 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-27 18:59:16,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:59:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-27 18:59:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-27 18:59:16,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:16,526 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] [2019-11-27 18:59:16,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 18:59:16,738 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:59:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1123996245, now seen corresponding path program 1 times [2019-11-27 18:59:16,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:16,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244939899] [2019-11-27 18:59:16,740 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:59:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:16,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:59:16,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:17,022 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:59:17,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:17,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:17,294 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:59:17,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244939899] [2019-11-27 18:59:17,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:17,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 18:59:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622188288] [2019-11-27 18:59:17,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:59:17,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:59:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:59:17,297 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 11 states. [2019-11-27 18:59:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:17,449 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-11-27 18:59:17,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:59:17,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-27 18:59:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:17,452 INFO L225 Difference]: With dead ends: 135 [2019-11-27 18:59:17,452 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 18:59:17,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 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:59:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 18:59:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 18:59:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 18:59:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-11-27 18:59:17,458 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 65 [2019-11-27 18:59:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:17,458 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-11-27 18:59:17,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:59:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-11-27 18:59:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-27 18:59:17,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:17,460 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] [2019-11-27 18:59:17,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 18:59:17,674 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:59:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash -638447166, now seen corresponding path program 1 times [2019-11-27 18:59:17,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:17,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390718211] [2019-11-27 18:59:17,676 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:59:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:17,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-27 18:59:17,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:17,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:59:17,915 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:17,916 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:17,917 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:17,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:18,180 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:59:18,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:18,394 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:59:18,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390718211] [2019-11-27 18:59:18,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:18,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 18 [2019-11-27 18:59:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486433967] [2019-11-27 18:59:18,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 18:59:18,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 18:59:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-27 18:59:18,396 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 19 states. [2019-11-27 18:59:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:19,918 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-27 18:59:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:59:19,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-11-27 18:59:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:19,921 INFO L225 Difference]: With dead ends: 183 [2019-11-27 18:59:19,921 INFO L226 Difference]: Without dead ends: 183 [2019-11-27 18:59:19,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:59:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-27 18:59:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-11-27 18:59:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 18:59:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-11-27 18:59:19,931 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 76 [2019-11-27 18:59:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:19,931 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-11-27 18:59:19,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 18:59:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-11-27 18:59:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-27 18:59:19,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:19,933 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] [2019-11-27 18:59:20,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 18:59:20,142 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:59:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash -638447165, now seen corresponding path program 1 times [2019-11-27 18:59:20,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:20,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877907639] [2019-11-27 18:59:20,143 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:59:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:20,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-27 18:59:20,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:20,397 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:59:20,398 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:20,407 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:20,407 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:20,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:20,948 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:59:20,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:23,250 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:59:23,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877907639] [2019-11-27 18:59:23,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:23,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 18] imperfect sequences [] total 36 [2019-11-27 18:59:23,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984974864] [2019-11-27 18:59:23,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-27 18:59:23,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-27 18:59:23,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-11-27 18:59:23,253 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 37 states. [2019-11-27 18:59:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:27,846 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-11-27 18:59:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:59:27,847 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-27 18:59:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:27,849 INFO L225 Difference]: With dead ends: 155 [2019-11-27 18:59:27,849 INFO L226 Difference]: Without dead ends: 155 [2019-11-27 18:59:27,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 18:59:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-27 18:59:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-27 18:59:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 18:59:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-27 18:59:27,859 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 76 [2019-11-27 18:59:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:27,859 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-27 18:59:27,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-27 18:59:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-27 18:59:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 18:59:27,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:27,861 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:28,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 18:59:28,064 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:59:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1131008798, now seen corresponding path program 1 times [2019-11-27 18:59:28,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:28,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396649818] [2019-11-27 18:59:28,069 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:59:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:28,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:59:28,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:28,384 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:28,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:28,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396649818] [2019-11-27 18:59:28,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:28,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-27 18:59:28,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231632003] [2019-11-27 18:59:28,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:59:28,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:59:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:59:28,617 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 14 states. [2019-11-27 18:59:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:28,768 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-11-27 18:59:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:59:28,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-27 18:59:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:28,770 INFO L225 Difference]: With dead ends: 159 [2019-11-27 18:59:28,771 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 18:59:28,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:59:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 18:59:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-27 18:59:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-27 18:59:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-27 18:59:28,777 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2019-11-27 18:59:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:28,778 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-27 18:59:28,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:59:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-27 18:59:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-27 18:59:28,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:28,779 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] [2019-11-27 18:59:28,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 18:59:28,981 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:59:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283129, now seen corresponding path program 1 times [2019-11-27 18:59:28,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:28,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318654193] [2019-11-27 18:59:28,984 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:59:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:29,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-27 18:59:29,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:29,272 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:59:29,273 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:29,274 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:29,275 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:29,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:29,747 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:59:29,748 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:30,022 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:59:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318654193] [2019-11-27 18:59:30,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:30,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22, 21] imperfect sequences [] total 22 [2019-11-27 18:59:30,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131213574] [2019-11-27 18:59:30,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:59:30,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:59:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:59:30,025 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-27 18:59:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:31,963 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2019-11-27 18:59:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-27 18:59:31,963 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-11-27 18:59:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:31,965 INFO L225 Difference]: With dead ends: 186 [2019-11-27 18:59:31,965 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 18:59:31,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-11-27 18:59:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 18:59:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2019-11-27 18:59:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-27 18:59:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2019-11-27 18:59:31,974 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 89 [2019-11-27 18:59:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:31,975 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2019-11-27 18:59:31,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:59:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2019-11-27 18:59:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-27 18:59:31,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:31,976 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] [2019-11-27 18:59:32,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 18:59:32,190 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:59:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283130, now seen corresponding path program 1 times [2019-11-27 18:59:32,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:32,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704976499] [2019-11-27 18:59:32,192 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:59:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:32,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-27 18:59:32,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:32,482 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:59:32,483 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:32,488 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:32,488 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:32,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:33,133 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:59:33,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:35,987 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:59:35,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704976499] [2019-11-27 18:59:35,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:35,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 22] imperfect sequences [] total 44 [2019-11-27 18:59:35,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529472996] [2019-11-27 18:59:35,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-27 18:59:35,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-27 18:59:35,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2019-11-27 18:59:35,990 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 45 states. [2019-11-27 18:59:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:41,249 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-27 18:59:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-27 18:59:41,251 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-27 18:59:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:41,254 INFO L225 Difference]: With dead ends: 157 [2019-11-27 18:59:41,254 INFO L226 Difference]: Without dead ends: 157 [2019-11-27 18:59:41,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2019-11-27 18:59:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-27 18:59:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-27 18:59:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 18:59:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-27 18:59:41,262 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 89 [2019-11-27 18:59:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:41,263 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-27 18:59:41,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-27 18:59:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-27 18:59:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 18:59:41,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:41,265 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:59:41,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 18:59:41,479 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:59:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 822322196, now seen corresponding path program 1 times [2019-11-27 18:59:41,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:41,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90442046] [2019-11-27 18:59:41,481 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:59:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:41,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-27 18:59:41,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:42,670 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:59:42,670 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:43,608 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:59:43,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90442046] [2019-11-27 18:59:43,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:43,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 21] imperfect sequences [] total 43 [2019-11-27 18:59:43,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801614049] [2019-11-27 18:59:43,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-27 18:59:43,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-27 18:59:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 18:59:43,611 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 44 states. [2019-11-27 18:59:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:46,567 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-27 18:59:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-27 18:59:46,569 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-11-27 18:59:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:46,571 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:59:46,571 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 18:59:46,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2019-11-27 18:59:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 18:59:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-27 18:59:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 18:59:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-27 18:59:46,577 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 92 [2019-11-27 18:59:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:46,578 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-27 18:59:46,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-27 18:59:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-27 18:59:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-27 18:59:46,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:46,580 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] [2019-11-27 18:59:46,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 18:59:46,793 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:59:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -692582595, now seen corresponding path program 1 times [2019-11-27 18:59:46,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:46,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886544689] [2019-11-27 18:59:46,795 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:59:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:47,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 18:59:47,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:47,349 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:59:47,349 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,357 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:47,357 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 18:59:47,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:47,420 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:59:47,420 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,457 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-27 18:59:47,457 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 18:59:47,560 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-27 18:59:47,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-27 18:59:47,562 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,579 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:47,579 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 18:59:47,714 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 18:59:47,714 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:59:47,715 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,734 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:47,734 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:47,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 18:59:48,442 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:59:48,443 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:48,851 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:59:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:50,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:52,952 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:59:53,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:59:53,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:59:53,179 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 18:59:53,181 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 18:59:53,181 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:59:53,200 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 18:59:53,201 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:59:53,201 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:53,202 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:53,202 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:53,203 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:53,203 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:59:53,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 18:59:54,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:59:54,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:59:55,399 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 18:59:55,401 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 18:59:55,401 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:59:55,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,662 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 18:59:55,662 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 18:59:55,663 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:59:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:55,676 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:55,886 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-27 18:59:55,887 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-27 18:59:55,888 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:55,932 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-27 18:59:55,932 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:55,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-27 18:59:57,407 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:59:57,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886544689] [2019-11-27 18:59:57,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:57,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 18:59:57,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173395625] [2019-11-27 18:59:57,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 18:59:57,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 18:59:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 18:59:57,410 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 55 states. [2019-11-27 19:00:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:00:05,791 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 19:00:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 19:00:05,792 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 95 [2019-11-27 19:00:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:00:05,792 INFO L225 Difference]: With dead ends: 60 [2019-11-27 19:00:05,792 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 19:00:05,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 19:00:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 19:00:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 19:00:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 19:00:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 19:00:05,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-27 19:00:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:00:05,794 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 19:00:05,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 19:00:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 19:00:05,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 19:00:05,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 19:00:06,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:00:06 BoogieIcfgContainer [2019-11-27 19:00:06,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 19:00:06,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 19:00:06,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 19:00:06,002 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 19:00:06,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:54" (3/4) ... [2019-11-27 19:00:06,012 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 19:00:06,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 19:00:06,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 19:00:06,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 19:00:06,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 19:00:06,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 19:00:06,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 19:00:06,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 19:00:06,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 19:00:06,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 19:00:06,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 19:00:06,034 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-11-27 19:00:06,035 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-27 19:00:06,035 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 19:00:06,035 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 19:00:06,036 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 19:00:06,110 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 19:00:06,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 19:00:06,111 INFO L168 Benchmark]: Toolchain (without parser) took 74142.83 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 311.7 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,112 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 19:00:06,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 997.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,113 INFO L168 Benchmark]: Boogie Preprocessor took 127.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,113 INFO L168 Benchmark]: RCFGBuilder took 1606.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,113 INFO L168 Benchmark]: TraceAbstraction took 71298.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 995.9 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 186.2 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,114 INFO L168 Benchmark]: Witness Printer took 108.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 135.6 kB). Peak memory consumption was 135.6 kB. Max. memory is 11.5 GB. [2019-11-27 19:00:06,122 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 997.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1606.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71298.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 995.9 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 186.2 MB. Max. memory is 11.5 GB. * Witness Printer took 108.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 135.6 kB). Peak memory consumption was 135.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 71.2s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 34.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2441 SDtfs, 1348 SDslu, 19465 SDs, 0 SdLazy, 12495 SolverSat, 417 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 26.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2494 GetRequests, 1978 SyntacticMatches, 52 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 134 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2392 ConstructedInterpolants, 306 QuantifiedInterpolants, 727040 SizeOfPredicates, 152 NumberOfNonLiveVariables, 5416 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 46 InterpolantComputations, 38 PerfectInterpolantSequences, 2984/3514 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...