./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 ......................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:13:35,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:13:35,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:13:35,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:13:35,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:13:35,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:13:35,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:13:35,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:13:35,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:13:35,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:13:35,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:13:35,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:13:35,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:13:35,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:13:35,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:13:35,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:13:35,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:13:35,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:13:35,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:13:35,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:13:35,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:13:35,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:13:35,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:13:35,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:13:35,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:13:35,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:13:35,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:13:35,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:13:35,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:13:35,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:13:35,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:13:35,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:13:35,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:13:35,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:13:35,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:13:35,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:13:35,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:13:35,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:13:35,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:13:35,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:13:35,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:13:35,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:13:35,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:13:35,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:13:35,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:13:35,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:13:35,587 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:13:35,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:13:35,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:13:35,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:13:35,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:13:35,588 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:13:35,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:13:35,590 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:13:35,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:13:35,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:13:35,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:13:35,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:13:35,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:13:35,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:13:35,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:13:35,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:13:35,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:13:35,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:13:35,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:13:35,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:13:35,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 17:13:35,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:13:35,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:13:35,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:13:35,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:13:35,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:13:35,917 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 17:13:35,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ac8655c/cd5c3c70da834537a72fcce6904ad26c/FLAG3bd4758ac [2019-11-25 17:13:36,540 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:13:36,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 17:13:36,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ac8655c/cd5c3c70da834537a72fcce6904ad26c/FLAG3bd4758ac [2019-11-25 17:13:36,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ac8655c/cd5c3c70da834537a72fcce6904ad26c [2019-11-25 17:13:36,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:13:36,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:13:36,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:13:36,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:13:36,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:13:36,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:13:36" (1/1) ... [2019-11-25 17:13:36,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11211d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:36, skipping insertion in model container [2019-11-25 17:13:36,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:13:36" (1/1) ... [2019-11-25 17:13:36,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:13:36,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:13:37,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:13:37,610 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-25 17:13:37,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b8d42f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:37, skipping insertion in model container [2019-11-25 17:13:37,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:13:37,611 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 17:13:37,615 INFO L168 Benchmark]: Toolchain (without parser) took 772.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -195.9 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:13:37,616 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:13:37,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -201.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:13:37,622 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 768.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -201.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6692e4f [2019-11-25 17:13:39,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:13:39,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:13:39,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:13:39,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:13:39,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:13:39,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:13:39,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:13:39,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:13:39,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:13:39,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:13:39,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:13:39,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:13:39,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:13:39,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:13:39,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:13:39,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:13:39,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:13:39,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:13:39,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:13:39,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:13:39,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:13:39,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:13:39,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:13:39,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:13:39,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:13:39,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:13:39,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:13:39,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:13:39,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:13:39,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:13:39,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:13:39,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:13:39,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:13:39,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:13:39,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:13:39,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:13:39,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:13:39,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:13:39,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:13:39,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:13:39,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 17:13:39,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:13:39,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:13:39,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:13:39,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:13:39,441 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:13:39,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:13:39,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:13:39,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:13:39,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:13:39,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:13:39,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:13:39,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:13:39,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:13:39,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:13:39,444 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 17:13:39,444 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 17:13:39,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:13:39,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:13:39,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:13:39,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:13:39,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:13:39,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:13:39,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:13:39,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:13:39,447 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 17:13:39,447 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 17:13:39,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 17:13:39,448 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 17:13:39,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:13:39,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:13:39,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:13:39,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:13:39,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:13:39,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 17:13:39,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc75825e/feb5b4f7ea1541b0860e26f0bd3da5f0/FLAGd5a16d309 [2019-11-25 17:13:40,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:13:40,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 17:13:40,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc75825e/feb5b4f7ea1541b0860e26f0bd3da5f0/FLAGd5a16d309 [2019-11-25 17:13:40,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc75825e/feb5b4f7ea1541b0860e26f0bd3da5f0 [2019-11-25 17:13:40,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:13:40,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:13:40,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:13:40,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:13:40,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:13:40,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:13:40" (1/1) ... [2019-11-25 17:13:40,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da9fcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:40, skipping insertion in model container [2019-11-25 17:13:40,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:13:40" (1/1) ... [2019-11-25 17:13:40,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:13:40,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:13:41,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:13:41,361 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 17:13:41,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:13:41,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:13:41,439 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:13:41,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:13:41,576 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:13:41,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41 WrapperNode [2019-11-25 17:13:41,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:13:41,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:13:41,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:13:41,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:13:41,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... [2019-11-25 17:13:41,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:13:41,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:13:41,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:13:41,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:13:41,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:13:41,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:13:41,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:13:41,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:13:41,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:13:41,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:13:41,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:13:41,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 17:13:41,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 17:13:41,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 17:13:41,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 17:13:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 17:13:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 17:13:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 17:13:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:13:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 17:13:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 17:13:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 17:13:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 17:13:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 17:13:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 17:13:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 17:13:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 17:13:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 17:13:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 17:13:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 17:13:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 17:13:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 17:13:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 17:13:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 17:13:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 17:13:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 17:13:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 17:13:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 17:13:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 17:13:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 17:13:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 17:13:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 17:13:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 17:13:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 17:13:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 17:13:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 17:13:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 17:13:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 17:13:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:13:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 17:13:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:13:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 17:13:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:13:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:13:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:13:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:13:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:13:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:13:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:13:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:13:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:13:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:13:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:13:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:13:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:13:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:13:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:13:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:13:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:13:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:13:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 17:13:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 17:13:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 17:13:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:13:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:13:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:13:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:13:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:13:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:13:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:13:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:13:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:13:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:13:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:13:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:13:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:13:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:13:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:13:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:13:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:13:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:13:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:13:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:13:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:13:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:13:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:13:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:13:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:13:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:13:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:13:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:13:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:13:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:13:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:13:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:13:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:13:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:13:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:13:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:13:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:13:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:13:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:13:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:13:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:13:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:13:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:13:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:13:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:13:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:13:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:13:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:13:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:13:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:13:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:13:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:13:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:13:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:13:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:13:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:13:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:13:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:13:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:13:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:13:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:13:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:13:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:13:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:13:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:13:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:13:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:13:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:13:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:13:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:13:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:13:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:13:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:13:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:13:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:13:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:13:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:13:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:13:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:13:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:13:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:13:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 17:13:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:13:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 17:13:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 17:13:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 17:13:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 17:13:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 17:13:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 17:13:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:13:41,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 17:13:41,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:13:41,806 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:13:41,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:13:41,806 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 17:13:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 17:13:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 17:13:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:13:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 17:13:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 17:13:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 17:13:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 17:13:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 17:13:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 17:13:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:13:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 17:13:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 17:13:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 17:13:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 17:13:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 17:13:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 17:13:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 17:13:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 17:13:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 17:13:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:13:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 17:13:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 17:13:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 17:13:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 17:13:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 17:13:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:13:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:13:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:13:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:13:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:13:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:13:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 17:13:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 17:13:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 17:13:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 17:13:42,471 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:13:42,846 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:13:43,207 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:13:43,208 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:13:43,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:13:43 BoogieIcfgContainer [2019-11-25 17:13:43,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:13:43,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:13:43,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:13:43,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:13:43,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:13:40" (1/3) ... [2019-11-25 17:13:43,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be3a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:13:43, skipping insertion in model container [2019-11-25 17:13:43,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:13:41" (2/3) ... [2019-11-25 17:13:43,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be3a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:13:43, skipping insertion in model container [2019-11-25 17:13:43,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:13:43" (3/3) ... [2019-11-25 17:13:43,217 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2019-11-25 17:13:43,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:13:43,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 17:13:43,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 17:13:43,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:13:43,264 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:13:43,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:13:43,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:13:43,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:13:43,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:13:43,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:13:43,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:13:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-11-25 17:13:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:13:43,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:43,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:43,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash -580210168, now seen corresponding path program 1 times [2019-11-25 17:13:43,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:43,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402815176] [2019-11-25 17:13:43,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:43,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:13:43,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:43,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:13:43,593 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:13:43,605 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:13:43,606 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:13:43,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:13:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:43,639 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402815176] [2019-11-25 17:13:43,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:43,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:13:43,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952667101] [2019-11-25 17:13:43,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:13:43,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:43,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:13:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:43,720 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-11-25 17:13:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:44,069 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-25 17:13:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:13:44,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 17:13:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:44,109 INFO L225 Difference]: With dead ends: 156 [2019-11-25 17:13:44,110 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 17:13:44,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 17:13:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2019-11-25 17:13:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 17:13:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-11-25 17:13:44,210 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 17 [2019-11-25 17:13:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:44,211 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-11-25 17:13:44,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:13:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-11-25 17:13:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:13:44,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:44,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:44,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 17:13:44,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash -580210167, now seen corresponding path program 1 times [2019-11-25 17:13:44,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:44,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926154853] [2019-11-25 17:13:44,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:44,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:13:44,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:44,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:13:44,597 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:13:44,606 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:13:44,606 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:13:44,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:13:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:44,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:44,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926154853] [2019-11-25 17:13:44,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:44,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 17:13:44,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081899663] [2019-11-25 17:13:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:13:44,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:13:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:13:44,994 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 10 states. [2019-11-25 17:13:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:45,731 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-11-25 17:13:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:13:45,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 17:13:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:45,736 INFO L225 Difference]: With dead ends: 152 [2019-11-25 17:13:45,736 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 17:13:45,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:13:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 17:13:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-11-25 17:13:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 17:13:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2019-11-25 17:13:45,749 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 17 [2019-11-25 17:13:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2019-11-25 17:13:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:13:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2019-11-25 17:13:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:13:45,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:45,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:45,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 17:13:45,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash -551581017, now seen corresponding path program 1 times [2019-11-25 17:13:45,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:45,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099968385] [2019-11-25 17:13:45,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:46,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:13:46,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:46,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:46,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099968385] [2019-11-25 17:13:46,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:46,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:13:46,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631638220] [2019-11-25 17:13:46,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:13:46,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:13:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:46,158 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2019-11-25 17:13:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:46,183 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2019-11-25 17:13:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:13:46,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 17:13:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:46,185 INFO L225 Difference]: With dead ends: 146 [2019-11-25 17:13:46,185 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 17:13:46,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 17:13:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 17:13:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 17:13:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-25 17:13:46,204 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 17 [2019-11-25 17:13:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:46,205 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-25 17:13:46,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:13:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-25 17:13:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 17:13:46,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:46,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:46,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 17:13:46,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash 180429038, now seen corresponding path program 1 times [2019-11-25 17:13:46,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:46,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406295374] [2019-11-25 17:13:46,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:46,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:13:46,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:46,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:46,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406295374] [2019-11-25 17:13:46,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:46,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:13:46,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842364433] [2019-11-25 17:13:46,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:13:46,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:13:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:46,688 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 5 states. [2019-11-25 17:13:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:46,734 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-25 17:13:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:13:46,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-25 17:13:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:46,738 INFO L225 Difference]: With dead ends: 146 [2019-11-25 17:13:46,738 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 17:13:46,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:13:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 17:13:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 17:13:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 17:13:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2019-11-25 17:13:46,759 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 27 [2019-11-25 17:13:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:46,760 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2019-11-25 17:13:46,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:13:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2019-11-25 17:13:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 17:13:46,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:46,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:46,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 17:13:46,966 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash -330105139, now seen corresponding path program 1 times [2019-11-25 17:13:46,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:46,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544348597] [2019-11-25 17:13:46,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:47,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:13:47,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:47,176 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:47,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-25 17:13:47,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544348597] [2019-11-25 17:13:47,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:47,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 17:13:47,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178269476] [2019-11-25 17:13:47,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:13:47,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:13:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:13:47,231 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 7 states. [2019-11-25 17:13:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:47,312 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-11-25 17:13:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:13:47,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 17:13:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:47,315 INFO L225 Difference]: With dead ends: 160 [2019-11-25 17:13:47,315 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 17:13:47,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:13:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 17:13:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2019-11-25 17:13:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 17:13:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2019-11-25 17:13:47,338 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 27 [2019-11-25 17:13:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:47,338 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2019-11-25 17:13:47,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:13:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2019-11-25 17:13:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:13:47,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:47,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:47,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 17:13:47,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 317366699, now seen corresponding path program 1 times [2019-11-25 17:13:47,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:47,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394889446] [2019-11-25 17:13:47,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:47,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:13:47,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:47,708 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:47,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394889446] [2019-11-25 17:13:47,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:47,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 17:13:47,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122239935] [2019-11-25 17:13:47,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:13:47,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:13:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:13:47,763 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2019-11-25 17:13:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:47,815 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2019-11-25 17:13:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:13:47,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 17:13:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:47,818 INFO L225 Difference]: With dead ends: 159 [2019-11-25 17:13:47,818 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 17:13:47,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:13:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 17:13:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-25 17:13:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-25 17:13:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2019-11-25 17:13:47,827 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 32 [2019-11-25 17:13:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:47,828 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2019-11-25 17:13:47,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:13:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2019-11-25 17:13:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:13:47,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:47,830 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:48,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 17:13:48,044 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1135828661, now seen corresponding path program 1 times [2019-11-25 17:13:48,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:48,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177077728] [2019-11-25 17:13:48,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:48,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:13:48,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:48,216 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:48,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177077728] [2019-11-25 17:13:48,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:13:48,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 17:13:48,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602140465] [2019-11-25 17:13:48,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:13:48,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:13:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:13:48,338 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 10 states. [2019-11-25 17:13:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:48,576 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2019-11-25 17:13:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:13:48,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 17:13:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:48,579 INFO L225 Difference]: With dead ends: 163 [2019-11-25 17:13:48,579 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 17:13:48,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:13:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 17:13:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-11-25 17:13:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-25 17:13:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2019-11-25 17:13:48,588 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 34 [2019-11-25 17:13:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:48,588 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2019-11-25 17:13:48,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:13:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2019-11-25 17:13:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:13:48,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:48,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:48,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 17:13:48,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash 591246760, now seen corresponding path program 1 times [2019-11-25 17:13:48,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:48,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226338914] [2019-11-25 17:13:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:48,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:13:48,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:49,067 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:49,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226338914] [2019-11-25 17:13:49,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:49,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 17:13:49,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933744040] [2019-11-25 17:13:49,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:13:49,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:13:49,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:13:49,114 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 7 states. [2019-11-25 17:13:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:49,166 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2019-11-25 17:13:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:13:49,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 17:13:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:49,168 INFO L225 Difference]: With dead ends: 169 [2019-11-25 17:13:49,168 INFO L226 Difference]: Without dead ends: 169 [2019-11-25 17:13:49,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:13:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-25 17:13:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-11-25 17:13:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 17:13:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2019-11-25 17:13:49,176 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 36 [2019-11-25 17:13:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:49,176 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2019-11-25 17:13:49,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:13:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2019-11-25 17:13:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:13:49,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:49,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:49,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 17:13:49,387 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash -212953728, now seen corresponding path program 1 times [2019-11-25 17:13:49,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:49,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114260279] [2019-11-25 17:13:49,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:49,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:13:49,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:49,546 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:49,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114260279] [2019-11-25 17:13:49,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:49,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:13:49,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004251792] [2019-11-25 17:13:49,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:13:49,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:13:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:13:49,684 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 3 states. [2019-11-25 17:13:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:49,890 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2019-11-25 17:13:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:13:49,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-25 17:13:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:49,893 INFO L225 Difference]: With dead ends: 176 [2019-11-25 17:13:49,893 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 17:13:49,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:13:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 17:13:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-11-25 17:13:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 17:13:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2019-11-25 17:13:49,904 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 34 [2019-11-25 17:13:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:49,905 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2019-11-25 17:13:49,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:13:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2019-11-25 17:13:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:13:49,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:49,909 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:50,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 17:13:50,122 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345269, now seen corresponding path program 2 times [2019-11-25 17:13:50,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:50,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101997765] [2019-11-25 17:13:50,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:50,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:13:50,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:13:50,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:13:50,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:50,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:13:50,266 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:13:50,268 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:13:50,269 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:13:50,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:13:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 17:13:50,406 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 17:13:50,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101997765] [2019-11-25 17:13:50,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:50,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 17:13:50,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271622719] [2019-11-25 17:13:50,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:13:50,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:13:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:13:50,482 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2019-11-25 17:13:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:51,523 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-11-25 17:13:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:13:51,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 17:13:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:51,525 INFO L225 Difference]: With dead ends: 157 [2019-11-25 17:13:51,525 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 17:13:51,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 17:13:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 17:13:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2019-11-25 17:13:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 17:13:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2019-11-25 17:13:51,531 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 38 [2019-11-25 17:13:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:51,532 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2019-11-25 17:13:51,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:13:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2019-11-25 17:13:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:13:51,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:51,533 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:51,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 17:13:51,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345268, now seen corresponding path program 1 times [2019-11-25 17:13:51,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:51,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227391156] [2019-11-25 17:13:51,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:51,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 17:13:51,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:52,005 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:52,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227391156] [2019-11-25 17:13:52,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:13:52,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 17:13:52,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252961743] [2019-11-25 17:13:52,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 17:13:52,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 17:13:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 17:13:52,504 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 18 states. [2019-11-25 17:13:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:53,533 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-25 17:13:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:13:53,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 17:13:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:53,537 INFO L225 Difference]: With dead ends: 157 [2019-11-25 17:13:53,537 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 17:13:53,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 17:13:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 17:13:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-25 17:13:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 17:13:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-25 17:13:53,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 38 [2019-11-25 17:13:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:53,551 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-25 17:13:53,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 17:13:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-25 17:13:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 17:13:53,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:53,553 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:53,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 17:13:53,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1038685964, now seen corresponding path program 2 times [2019-11-25 17:13:53,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729030301] [2019-11-25 17:13:53,761 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:53,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:13:53,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:13:53,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:13:53,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:53,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:13:53,975 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:13:53,981 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:13:53,982 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:13:53,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:13:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 17:13:54,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 17:13:55,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729030301] [2019-11-25 17:13:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:13:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 17:13:55,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830781067] [2019-11-25 17:13:55,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:13:55,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:13:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:13:55,062 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-25 17:13:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:13:57,841 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-11-25 17:13:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:13:57,842 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 17:13:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:13:57,843 INFO L225 Difference]: With dead ends: 152 [2019-11-25 17:13:57,843 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 17:13:57,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:13:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 17:13:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-25 17:13:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 17:13:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-25 17:13:57,849 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 46 [2019-11-25 17:13:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:13:57,850 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-25 17:13:57,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:13:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-25 17:13:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 17:13:57,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:13:57,851 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:13:58,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 17:13:58,060 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:13:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:13:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1614588820, now seen corresponding path program 1 times [2019-11-25 17:13:58,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:13:58,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481606067] [2019-11-25 17:13:58,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 17:13:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:13:58,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 17:13:58,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:13:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:58,443 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:13:58,560 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 17:13:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:13:59,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481606067] [2019-11-25 17:13:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:13:59,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 17:13:59,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423200549] [2019-11-25 17:13:59,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 17:13:59,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:13:59,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 17:13:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 17:13:59,547 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 34 states. [2019-11-25 17:14:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:03,562 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2019-11-25 17:14:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-25 17:14:03,563 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 17:14:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:03,564 INFO L225 Difference]: With dead ends: 170 [2019-11-25 17:14:03,564 INFO L226 Difference]: Without dead ends: 166 [2019-11-25 17:14:03,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 17:14:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-25 17:14:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-11-25 17:14:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-25 17:14:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions. [2019-11-25 17:14:03,584 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 51 [2019-11-25 17:14:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:03,585 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions. [2019-11-25 17:14:03,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 17:14:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions. [2019-11-25 17:14:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 17:14:03,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:03,586 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:03,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 17:14:03,793 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:03,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2083027508, now seen corresponding path program 2 times [2019-11-25 17:14:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183597874] [2019-11-25 17:14:03,796 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:03,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:14:03,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:14:03,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:14:03,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:03,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:03,975 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:03,977 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:03,978 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:03,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:14:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:04,166 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:04,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183597874] [2019-11-25 17:14:04,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:04,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 17:14:04,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267001204] [2019-11-25 17:14:04,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:14:04,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:14:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:14:04,247 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 12 states. [2019-11-25 17:14:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:05,168 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2019-11-25 17:14:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:14:05,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-25 17:14:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:05,171 INFO L225 Difference]: With dead ends: 176 [2019-11-25 17:14:05,171 INFO L226 Difference]: Without dead ends: 176 [2019-11-25 17:14:05,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 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-25 17:14:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-25 17:14:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2019-11-25 17:14:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-25 17:14:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2019-11-25 17:14:05,177 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 170 transitions. Word has length 65 [2019-11-25 17:14:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:05,178 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 170 transitions. [2019-11-25 17:14:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:14:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 170 transitions. [2019-11-25 17:14:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 17:14:05,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:05,179 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:05,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 17:14:05,390 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2083027509, now seen corresponding path program 1 times [2019-11-25 17:14:05,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:05,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581611595] [2019-11-25 17:14:05,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:05,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:14:05,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:05,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:05,623 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:05,627 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:05,627 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:05,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:14:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:05,877 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:06,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581611595] [2019-11-25 17:14:06,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:06,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 17:14:06,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83700191] [2019-11-25 17:14:06,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:14:06,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:14:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:14:06,705 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand 23 states. [2019-11-25 17:14:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:09,439 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-25 17:14:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:14:09,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-25 17:14:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:09,441 INFO L225 Difference]: With dead ends: 162 [2019-11-25 17:14:09,441 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 17:14:09,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:14:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 17:14:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 17:14:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 17:14:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2019-11-25 17:14:09,447 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 65 [2019-11-25 17:14:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:09,448 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2019-11-25 17:14:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:14:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2019-11-25 17:14:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 17:14:09,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:09,450 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:09,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 17:14:09,657 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash -552054101, now seen corresponding path program 1 times [2019-11-25 17:14:09,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:09,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32429872] [2019-11-25 17:14:09,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:09,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:14:09,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:09,981 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:10,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32429872] [2019-11-25 17:14:10,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:10,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 17:14:10,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139945299] [2019-11-25 17:14:10,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:14:10,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:14:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:14:10,131 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 8 states. [2019-11-25 17:14:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:10,193 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-25 17:14:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:14:10,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-25 17:14:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:10,197 INFO L225 Difference]: With dead ends: 164 [2019-11-25 17:14:10,198 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 17:14:10,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:14:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 17:14:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 17:14:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 17:14:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2019-11-25 17:14:10,204 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 68 [2019-11-25 17:14:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:10,205 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2019-11-25 17:14:10,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:14:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2019-11-25 17:14:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 17:14:10,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:10,207 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:10,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 17:14:10,420 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -188472710, now seen corresponding path program 1 times [2019-11-25 17:14:10,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:10,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865627371] [2019-11-25 17:14:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:10,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 17:14:10,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:10,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:10,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:10,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865627371] [2019-11-25 17:14:10,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:10,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 17:14:10,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25863616] [2019-11-25 17:14:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:14:10,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:14:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:14:10,956 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand 11 states. [2019-11-25 17:14:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:11,083 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-11-25 17:14:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:14:11,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-25 17:14:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:11,085 INFO L225 Difference]: With dead ends: 166 [2019-11-25 17:14:11,085 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 17:14:11,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:14:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 17:14:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-11-25 17:14:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 17:14:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-11-25 17:14:11,090 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 73 [2019-11-25 17:14:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:11,090 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-11-25 17:14:11,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:14:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-11-25 17:14:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 17:14:11,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:11,092 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:11,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 17:14:11,300 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -85285775, now seen corresponding path program 1 times [2019-11-25 17:14:11,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:11,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750515852] [2019-11-25 17:14:11,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:11,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 17:14:11,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:11,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:11,578 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:11,580 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:11,580 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:11,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:14:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:11,773 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:12,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750515852] [2019-11-25 17:14:12,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:12,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 14 [2019-11-25 17:14:12,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995503375] [2019-11-25 17:14:12,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 17:14:12,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 17:14:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-25 17:14:12,017 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 15 states. [2019-11-25 17:14:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:13,213 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-11-25 17:14:13,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:14:13,214 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2019-11-25 17:14:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:13,215 INFO L225 Difference]: With dead ends: 172 [2019-11-25 17:14:13,215 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 17:14:13,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:14:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 17:14:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2019-11-25 17:14:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-25 17:14:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2019-11-25 17:14:13,222 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 84 [2019-11-25 17:14:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:13,222 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2019-11-25 17:14:13,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 17:14:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2019-11-25 17:14:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 17:14:13,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:13,224 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:13,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 17:14:13,425 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash -85285774, now seen corresponding path program 1 times [2019-11-25 17:14:13,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:13,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915869933] [2019-11-25 17:14:13,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:13,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 17:14:13,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:13,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:13,702 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:13,706 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:13,707 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:13,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:14:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:14,229 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:15,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915869933] [2019-11-25 17:14:15,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:15,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2019-11-25 17:14:15,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126934522] [2019-11-25 17:14:15,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-25 17:14:15,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-25 17:14:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:14:15,723 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 29 states. [2019-11-25 17:14:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:19,149 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-25 17:14:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 17:14:19,150 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2019-11-25 17:14:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:19,152 INFO L225 Difference]: With dead ends: 158 [2019-11-25 17:14:19,152 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 17:14:19,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 17:14:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 17:14:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-25 17:14:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 17:14:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2019-11-25 17:14:19,157 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 84 [2019-11-25 17:14:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:19,157 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2019-11-25 17:14:19,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-25 17:14:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2019-11-25 17:14:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-25 17:14:19,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:19,159 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:19,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 17:14:19,374 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1669081220, now seen corresponding path program 1 times [2019-11-25 17:14:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:19,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575941477] [2019-11-25 17:14:19,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:19,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:14:19,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:19,695 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:19,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575941477] [2019-11-25 17:14:19,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:19,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 17:14:19,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780303028] [2019-11-25 17:14:19,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:14:19,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:14:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:14:19,860 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 11 states. [2019-11-25 17:14:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:19,940 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2019-11-25 17:14:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:14:19,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-11-25 17:14:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:19,942 INFO L225 Difference]: With dead ends: 161 [2019-11-25 17:14:19,942 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 17:14:19,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:14:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 17:14:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-25 17:14:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 17:14:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-11-25 17:14:19,947 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 93 [2019-11-25 17:14:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:19,948 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-11-25 17:14:19,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:14:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-11-25 17:14:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 17:14:19,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:19,950 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:20,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-25 17:14:20,163 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -754183911, now seen corresponding path program 1 times [2019-11-25 17:14:20,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:20,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977299243] [2019-11-25 17:14:20,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:20,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 17:14:20,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:20,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:20,493 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:20,495 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:20,495 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:20,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:14:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:20,809 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:20,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977299243] [2019-11-25 17:14:20,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:20,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-25 17:14:20,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337173632] [2019-11-25 17:14:20,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:14:20,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:14:20,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:14:20,995 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 17 states. [2019-11-25 17:14:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:22,332 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-11-25 17:14:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:14:22,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-11-25 17:14:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:22,334 INFO L225 Difference]: With dead ends: 172 [2019-11-25 17:14:22,334 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 17:14:22,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 189 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 17:14:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 17:14:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2019-11-25 17:14:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 17:14:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-11-25 17:14:22,341 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 106 [2019-11-25 17:14:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:22,341 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-11-25 17:14:22,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:14:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-11-25 17:14:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 17:14:22,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:22,343 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:22,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-25 17:14:22,552 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash -754183910, now seen corresponding path program 1 times [2019-11-25 17:14:22,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:22,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995306317] [2019-11-25 17:14:22,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:22,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:14:22,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:22,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:22,929 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:22,935 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:22,935 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:22,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:14:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:23,374 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:25,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995306317] [2019-11-25 17:14:25,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:25,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-25 17:14:25,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121900126] [2019-11-25 17:14:25,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 17:14:25,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:25,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 17:14:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 17:14:25,129 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 33 states. [2019-11-25 17:14:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:29,279 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-11-25 17:14:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:14:29,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-11-25 17:14:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:29,282 INFO L225 Difference]: With dead ends: 154 [2019-11-25 17:14:29,282 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 17:14:29,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 17:14:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 17:14:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 17:14:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 17:14:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2019-11-25 17:14:29,288 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 106 [2019-11-25 17:14:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:29,289 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2019-11-25 17:14:29,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 17:14:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2019-11-25 17:14:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 17:14:29,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:29,290 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:29,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-25 17:14:29,491 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1724966607, now seen corresponding path program 1 times [2019-11-25 17:14:29,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:29,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482069374] [2019-11-25 17:14:29,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:29,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:14:29,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:29,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:30,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482069374] [2019-11-25 17:14:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 17:14:30,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978493335] [2019-11-25 17:14:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:14:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:14:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:14:30,257 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 11 states. [2019-11-25 17:14:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:30,373 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-11-25 17:14:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:14:30,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-11-25 17:14:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:30,375 INFO L225 Difference]: With dead ends: 156 [2019-11-25 17:14:30,376 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 17:14:30,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:14:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 17:14:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 17:14:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 17:14:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-11-25 17:14:30,381 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 104 [2019-11-25 17:14:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:30,382 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-11-25 17:14:30,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:14:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-11-25 17:14:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 17:14:30,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:30,383 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:30,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-25 17:14:30,595 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1351384757, now seen corresponding path program 1 times [2019-11-25 17:14:30,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:30,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812231942] [2019-11-25 17:14:30,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:31,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 17:14:31,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:31,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:31,105 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:31,107 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:31,107 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:31,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:14:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:31,471 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:31,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812231942] [2019-11-25 17:14:31,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:31,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-25 17:14:31,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232264498] [2019-11-25 17:14:31,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:14:31,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:31,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:14:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:14:31,757 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 21 states. [2019-11-25 17:14:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:33,328 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2019-11-25 17:14:33,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 17:14:33,329 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2019-11-25 17:14:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:33,331 INFO L225 Difference]: With dead ends: 164 [2019-11-25 17:14:33,331 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 17:14:33,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-25 17:14:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 17:14:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-25 17:14:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 17:14:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2019-11-25 17:14:33,337 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 119 [2019-11-25 17:14:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:33,338 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2019-11-25 17:14:33,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:14:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2019-11-25 17:14:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 17:14:33,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:33,339 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:33,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-25 17:14:33,544 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1351384756, now seen corresponding path program 1 times [2019-11-25 17:14:33,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:33,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431150392] [2019-11-25 17:14:33,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:33,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-25 17:14:33,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:33,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:14:33,910 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:33,915 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:33,916 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:33,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:14:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:34,649 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:36,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431150392] [2019-11-25 17:14:36,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:36,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-25 17:14:36,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533938495] [2019-11-25 17:14:36,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-25 17:14:36,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-25 17:14:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 17:14:36,991 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 41 states. [2019-11-25 17:14:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:41,864 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-11-25 17:14:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 17:14:41,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2019-11-25 17:14:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:41,866 INFO L225 Difference]: With dead ends: 150 [2019-11-25 17:14:41,866 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 17:14:41,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 190 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 17:14:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 17:14:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 17:14:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 17:14:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-11-25 17:14:41,871 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 119 [2019-11-25 17:14:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:41,871 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-11-25 17:14:41,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-25 17:14:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-11-25 17:14:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 17:14:41,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:41,872 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:42,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-25 17:14:42,077 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1920404098, now seen corresponding path program 1 times [2019-11-25 17:14:42,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:42,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568739738] [2019-11-25 17:14:42,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:42,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:14:42,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:43,384 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 17:14:44,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568739738] [2019-11-25 17:14:44,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:14:44,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-25 17:14:44,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460259505] [2019-11-25 17:14:44,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-25 17:14:44,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:14:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-25 17:14:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-25 17:14:44,274 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 40 states. [2019-11-25 17:14:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:14:46,367 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-11-25 17:14:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 17:14:46,368 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2019-11-25 17:14:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:14:46,369 INFO L225 Difference]: With dead ends: 149 [2019-11-25 17:14:46,369 INFO L226 Difference]: Without dead ends: 149 [2019-11-25 17:14:46,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 198 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 17:14:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-25 17:14:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-25 17:14:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-25 17:14:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2019-11-25 17:14:46,375 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 122 [2019-11-25 17:14:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:14:46,376 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2019-11-25 17:14:46,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-25 17:14:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2019-11-25 17:14:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 17:14:46,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:14:46,377 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:14:46,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-25 17:14:46,581 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:14:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:14:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1794433551, now seen corresponding path program 1 times [2019-11-25 17:14:46,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:14:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190274246] [2019-11-25 17:14:46,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-25 17:14:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:14:47,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-25 17:14:47,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:14:47,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-25 17:14:47,573 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,583 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:47,584 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-25 17:14:47,673 INFO L343 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2019-11-25 17:14:47,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-11-25 17:14:47,675 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,687 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:47,687 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-25 17:14:47,867 INFO L343 Elim1Store]: treesize reduction 12, result has 86.5 percent of original size [2019-11-25 17:14:47,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 96 [2019-11-25 17:14:47,868 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,924 INFO L588 ElimStorePlain]: treesize reduction 58, result has 37.6 percent of original size [2019-11-25 17:14:47,924 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:47,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-25 17:14:48,171 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 17:14:48,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-25 17:14:48,173 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:48,190 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:48,191 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:48,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 17:14:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:14:49,233 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:14:50,039 WARN L192 SmtUtils]: Spent 765.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 17:14:51,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:52,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:55,213 WARN L192 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 17:14:55,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:14:55,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:14:55,447 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 17:14:55,448 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 17:14:55,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-25 17:14:55,455 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 17:14:55,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-25 17:14:55,455 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:55,456 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:55,456 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:55,457 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:14:55,458 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:55,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 17:14:57,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:14:57,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:14:57,834 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 17:14:57,835 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 17:14:57,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-25 17:14:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,108 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 17:14:58,108 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 17:14:58,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 231 [2019-11-25 17:14:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:14:58,118 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:14:58,304 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-25 17:14:58,305 INFO L588 ElimStorePlain]: treesize reduction 229, result has 31.6 percent of original size [2019-11-25 17:14:58,306 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:58,353 INFO L588 ElimStorePlain]: treesize reduction 73, result has 33.6 percent of original size [2019-11-25 17:14:58,353 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:14:58,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-25 17:15:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:15:01,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190274246] [2019-11-25 17:15:01,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:15:01,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 79 [2019-11-25 17:15:01,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436268308] [2019-11-25 17:15:01,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-25 17:15:01,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:15:01,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-25 17:15:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=5859, Unknown=0, NotChecked=0, Total=6162 [2019-11-25 17:15:01,904 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 79 states. [2019-11-25 17:15:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:15:11,373 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-25 17:15:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-25 17:15:11,377 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 125 [2019-11-25 17:15:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:15:11,377 INFO L225 Difference]: With dead ends: 72 [2019-11-25 17:15:11,377 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:15:11,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=354, Invalid=6786, Unknown=0, NotChecked=0, Total=7140 [2019-11-25 17:15:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:15:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:15:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:15:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:15:11,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-11-25 17:15:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:15:11,381 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:15:11,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-25 17:15:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:15:11,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:15:11,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-25 17:15:11,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:15:11 BoogieIcfgContainer [2019-11-25 17:15:11,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:15:11,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:15:11,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:15:11,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:15:11,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:13:43" (3/4) ... [2019-11-25 17:15:11,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:15:11,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 17:15:11,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:15:11,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 17:15:11,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 17:15:11,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 17:15:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 17:15:11,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 17:15:11,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 17:15:11,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 17:15:11,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 17:15:11,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 17:15:11,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 17:15:11,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 17:15:11,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 17:15:11,621 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2019-11-25 17:15:11,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 17:15:11,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:15:11,625 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:15:11,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:15:11,681 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:15:11,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:15:11,683 INFO L168 Benchmark]: Toolchain (without parser) took 90973.31 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 560.5 MB). Free memory was 956.3 MB in the beginning and 833.8 MB in the end (delta: 122.5 MB). Peak memory consumption was 683.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:15:11,684 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:15:11,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:15:11,685 INFO L168 Benchmark]: Boogie Preprocessor took 103.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:15:11,685 INFO L168 Benchmark]: RCFGBuilder took 1527.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:15:11,686 INFO L168 Benchmark]: TraceAbstraction took 88378.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 411.0 MB). Free memory was 994.6 MB in the beginning and 834.0 MB in the end (delta: 160.6 MB). Peak memory consumption was 571.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:15:11,686 INFO L168 Benchmark]: Witness Printer took 93.04 ms. Allocated memory is still 1.6 GB. Free memory was 834.0 MB in the beginning and 833.8 MB in the end (delta: 151.1 kB). Peak memory consumption was 151.1 kB. Max. memory is 11.5 GB. [2019-11-25 17:15:11,688 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.27 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 865.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1527.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88378.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 411.0 MB). Free memory was 994.6 MB in the beginning and 834.0 MB in the end (delta: 160.6 MB). Peak memory consumption was 571.7 MB. Max. memory is 11.5 GB. * Witness Printer took 93.04 ms. Allocated memory is still 1.6 GB. Free memory was 834.0 MB in the beginning and 833.8 MB in the end (delta: 151.1 kB). Peak memory consumption was 151.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 333 locations, 71 error locations. Result: SAFE, OverallTime: 88.3s, OverallIterations: 27, TraceHistogramMax: 28, AutomataDifference: 42.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3248 SDtfs, 1654 SDslu, 25766 SDs, 0 SdLazy, 14765 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3563 GetRequests, 2958 SyntacticMatches, 67 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3059 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 98 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3440 ConstructedInterpolants, 586 QuantifiedInterpolants, 1298540 SizeOfPredicates, 165 NumberOfNonLiveVariables, 7504 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 10808/11878 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...