./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 927b64548732fdfa523149393b95aeee194275ea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:12:30,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:12:30,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:12:30,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:12:30,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:12:30,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:12:30,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:12:30,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:12:30,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:12:30,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:12:30,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:12:30,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:12:30,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:12:30,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:12:30,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:12:30,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:12:30,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:12:30,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:12:30,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:12:30,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:12:30,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:12:30,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:12:30,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:12:30,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:12:30,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:12:30,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:12:30,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:12:30,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:12:30,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:12:30,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:12:30,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:12:30,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:12:30,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:12:30,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:12:30,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:12:30,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:12:30,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:12:30,789 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:12:30,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:12:30,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:12:30,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:12:30,791 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:12:30,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:12:30,792 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:12:30,792 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:12:30,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:12:30,792 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:12:30,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:12:30,793 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:12:30,794 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:12:30,794 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:12:30,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:12:30,795 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:12:30,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:12:30,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:12:30,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:12:30,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:12:30,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:12:30,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:12:30,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:12:30,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:12:30,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:12:30,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927b64548732fdfa523149393b95aeee194275ea [2019-01-14 19:12:30,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:12:30,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:12:30,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:12:30,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:12:30,875 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:12:30,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2019-01-14 19:12:30,951 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d38cbc8/fb381643175f4c58ab2b774a05c76ab4/FLAG2835bbccd [2019-01-14 19:12:31,524 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:12:31,524 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2019-01-14 19:12:31,541 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d38cbc8/fb381643175f4c58ab2b774a05c76ab4/FLAG2835bbccd [2019-01-14 19:12:31,739 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d38cbc8/fb381643175f4c58ab2b774a05c76ab4 [2019-01-14 19:12:31,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:12:31,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:12:31,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:12:31,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:12:31,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:12:31,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:12:31" (1/1) ... [2019-01-14 19:12:31,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db5133f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:31, skipping insertion in model container [2019-01-14 19:12:31,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:12:31" (1/1) ... [2019-01-14 19:12:31,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:12:31,839 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:12:32,251 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:12:32,270 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:12:32,478 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:12:32,565 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:12:32,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32 WrapperNode [2019-01-14 19:12:32,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:12:32,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:12:32,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:12:32,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:12:32,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (1/1) ... [2019-01-14 19:12:32,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:12:32,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:12:32,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:12:32,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:12:32,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (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-01-14 19:12:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-14 19:12:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-14 19:12:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-14 19:12:32,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-14 19:12:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-14 19:12:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-14 19:12:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-14 19:12:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-14 19:12:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-14 19:12:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-14 19:12:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-14 19:12:32,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-14 19:12:32,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2019-01-14 19:12:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2019-01-14 19:12:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-14 19:12:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:12:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-14 19:12:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-14 19:12:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 19:12:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 19:12:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 19:12:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:12:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:12:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:12:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:12:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:12:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:12:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:12:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:12:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:12:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:12:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:12:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:12:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:12:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:12:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:12:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:12:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:12:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:12:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:12:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:12:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:12:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:12:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:12:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:12:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:12:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:12:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:12:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:12:32,780 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:12:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:12:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:12:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:12:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:12:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:12:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:12:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:12:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:12:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-14 19:12:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-14 19:12:32,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-14 19:12:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-14 19:12:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:12:32,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-14 19:12:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-14 19:12:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:12:32,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-14 19:12:32,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2019-01-14 19:12:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2019-01-14 19:12:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2019-01-14 19:12:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:12:32,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-14 19:12:32,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-14 19:12:32,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 19:12:32,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 19:12:33,796 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:12:34,510 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:12:34,983 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:12:34,984 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 19:12:34,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:12:34 BoogieIcfgContainer [2019-01-14 19:12:34,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:12:34,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:12:34,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:12:34,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:12:34,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:12:31" (1/3) ... [2019-01-14 19:12:34,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ce2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:12:34, skipping insertion in model container [2019-01-14 19:12:34,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:12:32" (2/3) ... [2019-01-14 19:12:34,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ce2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:12:34, skipping insertion in model container [2019-01-14 19:12:34,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:12:34" (3/3) ... [2019-01-14 19:12:34,993 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2019-01-14 19:12:35,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:12:35,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 94 error locations. [2019-01-14 19:12:35,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2019-01-14 19:12:35,054 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:12:35,055 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:12:35,055 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:12:35,055 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:12:35,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:12:35,056 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:12:35,056 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:12:35,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:12:35,056 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:12:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-01-14 19:12:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:12:35,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:35,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:35,097 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2043136295, now seen corresponding path program 1 times [2019-01-14 19:12:35,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:35,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:35,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:35,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:35,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:35,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:35,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:12:35,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:12:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:12:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:35,707 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 8 states. [2019-01-14 19:12:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:37,687 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2019-01-14 19:12:37,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:12:37,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 19:12:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:37,703 INFO L225 Difference]: With dead ends: 157 [2019-01-14 19:12:37,703 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 19:12:37,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:12:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 19:12:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 88. [2019-01-14 19:12:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 19:12:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-01-14 19:12:37,761 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2019-01-14 19:12:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:37,762 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-01-14 19:12:37,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:12:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-01-14 19:12:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:12:37,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:37,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:37,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2043136294, now seen corresponding path program 1 times [2019-01-14 19:12:37,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:37,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:37,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:12:37,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:12:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:12:37,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:37,965 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2019-01-14 19:12:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:38,606 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2019-01-14 19:12:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:12:38,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 19:12:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:38,611 INFO L225 Difference]: With dead ends: 138 [2019-01-14 19:12:38,612 INFO L226 Difference]: Without dead ends: 138 [2019-01-14 19:12:38,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:12:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-14 19:12:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2019-01-14 19:12:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 19:12:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-01-14 19:12:38,626 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2019-01-14 19:12:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:38,626 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-01-14 19:12:38,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:12:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-01-14 19:12:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:12:38,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:38,627 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:38,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1653554949, now seen corresponding path program 1 times [2019-01-14 19:12:38,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:38,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:12:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:12:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:12:38,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:12:38,919 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 11 states. [2019-01-14 19:12:39,380 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 19:12:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:40,169 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2019-01-14 19:12:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:12:40,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-14 19:12:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:40,173 INFO L225 Difference]: With dead ends: 132 [2019-01-14 19:12:40,174 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 19:12:40,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:12:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 19:12:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2019-01-14 19:12:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 19:12:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-01-14 19:12:40,184 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 26 [2019-01-14 19:12:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:40,185 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-01-14 19:12:40,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:12:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-01-14 19:12:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:12:40,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:40,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:40,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1653554950, now seen corresponding path program 1 times [2019-01-14 19:12:40,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:40,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:40,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:12:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 19:12:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:12:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:12:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:12:40,604 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 10 states. [2019-01-14 19:12:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:41,453 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2019-01-14 19:12:41,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:12:41,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-14 19:12:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:41,457 INFO L225 Difference]: With dead ends: 130 [2019-01-14 19:12:41,457 INFO L226 Difference]: Without dead ends: 130 [2019-01-14 19:12:41,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:12:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-14 19:12:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2019-01-14 19:12:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 19:12:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-14 19:12:41,470 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 26 [2019-01-14 19:12:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:41,470 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-14 19:12:41,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:12:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-14 19:12:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:12:41,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:41,473 INFO L402 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] [2019-01-14 19:12:41,474 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2039918876, now seen corresponding path program 1 times [2019-01-14 19:12:41,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:41,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:41,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:12:41,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:12:41,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:12:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:12:41,582 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2019-01-14 19:12:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:41,694 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-01-14 19:12:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:12:41,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 19:12:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:41,696 INFO L225 Difference]: With dead ends: 88 [2019-01-14 19:12:41,696 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 19:12:41,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 19:12:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-01-14 19:12:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 19:12:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-01-14 19:12:41,706 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 26 [2019-01-14 19:12:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:41,707 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-01-14 19:12:41,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:12:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-01-14 19:12:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:12:41,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:41,709 INFO L402 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] [2019-01-14 19:12:41,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash -532367067, now seen corresponding path program 1 times [2019-01-14 19:12:41,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:41,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:41,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:41,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:41,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:41,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:12:41,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:12:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:12:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:41,901 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 8 states. [2019-01-14 19:12:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:42,081 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-01-14 19:12:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:12:42,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 19:12:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:42,085 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:12:42,085 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:12:42,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:12:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:12:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2019-01-14 19:12:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 19:12:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2019-01-14 19:12:42,094 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 26 [2019-01-14 19:12:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:42,095 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2019-01-14 19:12:42,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:12:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2019-01-14 19:12:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:12:42,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:42,098 INFO L402 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] [2019-01-14 19:12:42,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -532367066, now seen corresponding path program 1 times [2019-01-14 19:12:42,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:42,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:42,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:42,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:42,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:12:42,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:12:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:12:42,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:12:42,305 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand 6 states. [2019-01-14 19:12:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:42,336 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-01-14 19:12:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:12:42,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 19:12:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:42,340 INFO L225 Difference]: With dead ends: 95 [2019-01-14 19:12:42,341 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 19:12:42,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:12:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 19:12:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-14 19:12:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 19:12:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2019-01-14 19:12:42,361 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 26 [2019-01-14 19:12:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:42,361 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2019-01-14 19:12:42,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:12:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2019-01-14 19:12:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 19:12:42,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:42,363 INFO L402 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-01-14 19:12:42,363 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 677115345, now seen corresponding path program 1 times [2019-01-14 19:12:42,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:42,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:12:42,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:12:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:12:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:12:42,468 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2019-01-14 19:12:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:42,839 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2019-01-14 19:12:42,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:12:42,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-01-14 19:12:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:42,843 INFO L225 Difference]: With dead ends: 121 [2019-01-14 19:12:42,843 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 19:12:42,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:12:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 19:12:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-01-14 19:12:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 19:12:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-01-14 19:12:42,871 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 27 [2019-01-14 19:12:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-01-14 19:12:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:12:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-01-14 19:12:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:12:42,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:42,881 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:42,882 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1315501362, now seen corresponding path program 1 times [2019-01-14 19:12:42,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:42,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:42,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:12:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:43,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:12:43,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:12:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:12:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:12:43,067 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 5 states. [2019-01-14 19:12:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:43,092 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2019-01-14 19:12:43,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:12:43,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-14 19:12:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:43,095 INFO L225 Difference]: With dead ends: 120 [2019-01-14 19:12:43,095 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 19:12:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:12:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 19:12:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-01-14 19:12:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 19:12:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-01-14 19:12:43,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 35 [2019-01-14 19:12:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:43,105 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-01-14 19:12:43,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:12:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-01-14 19:12:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:12:43,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:43,108 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:43,109 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -427997681, now seen corresponding path program 1 times [2019-01-14 19:12:43,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:43,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:12:43,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:12:43,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:12:43,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:12:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:12:43,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:12:43,278 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 6 states. [2019-01-14 19:12:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:43,356 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-01-14 19:12:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:12:43,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-14 19:12:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:43,359 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:12:43,359 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:12:43,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:12:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-14 19:12:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 19:12:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-01-14 19:12:43,367 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 35 [2019-01-14 19:12:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:43,367 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-01-14 19:12:43,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:12:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-01-14 19:12:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:12:43,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:43,372 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:43,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -721400688, now seen corresponding path program 1 times [2019-01-14 19:12:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:43,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:12:43,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:12:43,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:12:43,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:44,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:12:44,155 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:12:44,158 INFO L478 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 10 treesize of output 9 [2019-01-14 19:12:44,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:44,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:44,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:44,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-14 19:12:45,061 WARN L860 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-14 19:12:45,078 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 19:12:45,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-14 19:12:45,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:45,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:45,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:12:45,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-01-14 19:12:45,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 19:12:45,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-14 19:12:45,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:45,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:45,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-01-14 19:12:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:12:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:12:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 17 [2019-01-14 19:12:45,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 19:12:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 19:12:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2019-01-14 19:12:45,235 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 18 states. [2019-01-14 19:12:47,234 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 19:12:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:47,729 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-01-14 19:12:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:12:47,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-14 19:12:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:47,734 INFO L225 Difference]: With dead ends: 108 [2019-01-14 19:12:47,734 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 19:12:47,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=4, NotChecked=50, Total=756 [2019-01-14 19:12:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 19:12:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 19:12:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:12:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-14 19:12:47,743 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 35 [2019-01-14 19:12:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:47,744 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-14 19:12:47,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 19:12:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-14 19:12:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 19:12:47,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:47,748 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:47,749 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -888584637, now seen corresponding path program 1 times [2019-01-14 19:12:47,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:47,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:47,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:47,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:47,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:48,460 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 19:12:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:12:48,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:12:48,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:12:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:48,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:12:48,835 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:12:48,854 INFO L478 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 10 treesize of output 9 [2019-01-14 19:12:48,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 19:12:48,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-01-14 19:12:48,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-14 19:12:48,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:48,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-14 19:12:49,486 WARN L860 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret38.base|))) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2019-01-14 19:12:49,537 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 19:12:49,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:12:49,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 19:12:49,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-14 19:12:49,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 19:12:49,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-01-14 19:12:49,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:49,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 19:12:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:12:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:12:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-01-14 19:12:49,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:12:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:12:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2019-01-14 19:12:49,709 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 17 states. [2019-01-14 19:12:52,247 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 19:12:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:52,766 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-14 19:12:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 19:12:52,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-14 19:12:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:52,769 INFO L225 Difference]: With dead ends: 124 [2019-01-14 19:12:52,769 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 19:12:52,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=4, NotChecked=52, Total=812 [2019-01-14 19:12:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 19:12:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2019-01-14 19:12:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 19:12:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2019-01-14 19:12:52,787 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 36 [2019-01-14 19:12:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:52,788 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2019-01-14 19:12:52,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:12:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2019-01-14 19:12:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 19:12:52,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:52,789 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:52,795 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:52,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1329173316, now seen corresponding path program 1 times [2019-01-14 19:12:52,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:52,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:52,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:12:53,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:12:53,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:12:53,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:53,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:12:53,091 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:12:53,097 INFO L478 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 10 treesize of output 9 [2019-01-14 19:12:53,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,144 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:12:53,147 INFO L478 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 10 treesize of output 9 [2019-01-14 19:12:53,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-01-14 19:12:53,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 19:12:53,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-14 19:12:53,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 19:12:53,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-14 19:12:53,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-01-14 19:12:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:53,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:12:53,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-14 19:12:53,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:12:53,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:12:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:12:53,246 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 6 states. [2019-01-14 19:12:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:12:53,325 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2019-01-14 19:12:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:12:53,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-14 19:12:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:12:53,330 INFO L225 Difference]: With dead ends: 95 [2019-01-14 19:12:53,330 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 19:12:53,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:12:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 19:12:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-01-14 19:12:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 19:12:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-01-14 19:12:53,336 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2019-01-14 19:12:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:12:53,338 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-01-14 19:12:53,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:12:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-01-14 19:12:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 19:12:53,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:12:53,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:12:53,342 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:12:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:12:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1776319758, now seen corresponding path program 1 times [2019-01-14 19:12:53,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:12:53,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:12:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:53,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:12:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:53,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:12:53,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:12:53,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:12:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:12:53,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:12:53,801 INFO L478 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-01-14 19:12:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:12:53,947 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:12:53,951 INFO L478 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 10 treesize of output 9 [2019-01-14 19:12:53,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:53,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 19:12:58,056 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 19:12:58,068 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 19:12:58,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 18 treesize of output 28 [2019-01-14 19:12:58,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 19:12:58,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 19:12:58,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 19:12:58,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2019-01-14 19:12:58,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-14 19:12:58,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-14 19:12:58,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:12:58,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:12:58,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-14 19:12:58,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 19:12:58,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 19:12:58,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 19:12:58,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 19:12:58,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2019-01-14 19:12:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:12:58,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:12:58,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-01-14 19:12:58,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 19:12:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 19:12:58,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=389, Unknown=8, NotChecked=0, Total=462 [2019-01-14 19:12:58,358 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 22 states. [2019-01-14 19:13:16,972 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 19:13:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:17,157 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2019-01-14 19:13:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 19:13:17,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-01-14 19:13:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:17,160 INFO L225 Difference]: With dead ends: 102 [2019-01-14 19:13:17,160 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 19:13:17,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=151, Invalid=892, Unknown=13, NotChecked=0, Total=1056 [2019-01-14 19:13:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 19:13:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2019-01-14 19:13:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 19:13:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-01-14 19:13:17,169 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 37 [2019-01-14 19:13:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:17,170 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-01-14 19:13:17,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 19:13:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-01-14 19:13:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 19:13:17,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:17,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:17,171 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2015343300, now seen corresponding path program 1 times [2019-01-14 19:13:17,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:17,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:17,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:13:17,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:13:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:13:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:13:17,341 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 8 states. [2019-01-14 19:13:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:17,535 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-01-14 19:13:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:13:17,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-14 19:13:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:17,538 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:13:17,538 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:13:17,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:13:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:13:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-01-14 19:13:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 19:13:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-01-14 19:13:17,543 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2019-01-14 19:13:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:17,543 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-01-14 19:13:17,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:13:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-01-14 19:13:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 19:13:17,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:17,544 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:17,545 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2015343301, now seen corresponding path program 1 times [2019-01-14 19:13:17,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:18,182 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-14 19:13:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:18,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:13:18,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:13:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:13:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:13:18,260 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 11 states. [2019-01-14 19:13:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:18,782 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-14 19:13:18,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:13:18,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-01-14 19:13:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:18,785 INFO L225 Difference]: With dead ends: 102 [2019-01-14 19:13:18,785 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 19:13:18,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:13:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 19:13:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-01-14 19:13:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 19:13:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-14 19:13:18,790 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 42 [2019-01-14 19:13:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:18,791 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-14 19:13:18,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:13:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-14 19:13:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 19:13:18,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:18,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:18,793 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1948867153, now seen corresponding path program 1 times [2019-01-14 19:13:18,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:18,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:19,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:13:19,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:13:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:13:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:13:19,097 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2019-01-14 19:13:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:19,253 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-01-14 19:13:19,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:13:19,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-01-14 19:13:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:19,255 INFO L225 Difference]: With dead ends: 101 [2019-01-14 19:13:19,255 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 19:13:19,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:13:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 19:13:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-01-14 19:13:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 19:13:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-01-14 19:13:19,259 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 43 [2019-01-14 19:13:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:19,259 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-01-14 19:13:19,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:13:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-01-14 19:13:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:13:19,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:19,264 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:19,264 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash -285339548, now seen corresponding path program 1 times [2019-01-14 19:13:19,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:19,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:13:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:13:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:13:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:13:19,508 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 11 states. [2019-01-14 19:13:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:19,901 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-01-14 19:13:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:13:19,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-01-14 19:13:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:19,904 INFO L225 Difference]: With dead ends: 124 [2019-01-14 19:13:19,904 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 19:13:19,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:13:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 19:13:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-01-14 19:13:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 19:13:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-14 19:13:19,909 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 44 [2019-01-14 19:13:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:19,909 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-14 19:13:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:13:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-14 19:13:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:13:19,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:19,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:19,911 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1971571459, now seen corresponding path program 1 times [2019-01-14 19:13:19,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 19:13:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:13:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:13:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:13:20,265 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 12 states. [2019-01-14 19:13:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:20,602 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-14 19:13:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 19:13:20,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-01-14 19:13:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:20,606 INFO L225 Difference]: With dead ends: 123 [2019-01-14 19:13:20,606 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 19:13:20,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:13:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 19:13:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-01-14 19:13:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 19:13:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-01-14 19:13:20,613 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 44 [2019-01-14 19:13:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:20,613 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-01-14 19:13:20,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:13:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-01-14 19:13:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:13:20,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:20,615 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:20,616 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1461037282, now seen corresponding path program 1 times [2019-01-14 19:13:20,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:20,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:20,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:20,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:13:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:13:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:13:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:13:20,736 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 5 states. [2019-01-14 19:13:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:20,778 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-01-14 19:13:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:13:20,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-01-14 19:13:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:20,781 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:13:20,781 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:13:20,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:13:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:13:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-14 19:13:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 19:13:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-01-14 19:13:20,790 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 44 [2019-01-14 19:13:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:20,791 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-01-14 19:13:20,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:13:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-01-14 19:13:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 19:13:20,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:20,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:20,793 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash -255591343, now seen corresponding path program 1 times [2019-01-14 19:13:20,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:20,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:21,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:13:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:13:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:13:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:13:21,533 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 11 states. [2019-01-14 19:13:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:21,768 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-01-14 19:13:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:13:21,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-14 19:13:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:21,771 INFO L225 Difference]: With dead ends: 108 [2019-01-14 19:13:21,772 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 19:13:21,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:13:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 19:13:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-01-14 19:13:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 19:13:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-01-14 19:13:21,779 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 45 [2019-01-14 19:13:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:21,780 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-01-14 19:13:21,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:13:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-01-14 19:13:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 19:13:21,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:21,784 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:21,785 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2076316168, now seen corresponding path program 1 times [2019-01-14 19:13:21,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:21,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:21,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 19:13:22,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:13:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:13:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:13:22,053 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 10 states. [2019-01-14 19:13:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:22,372 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2019-01-14 19:13:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:13:22,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-01-14 19:13:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:22,377 INFO L225 Difference]: With dead ends: 121 [2019-01-14 19:13:22,377 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 19:13:22,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:13:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 19:13:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2019-01-14 19:13:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 19:13:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-01-14 19:13:22,381 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 46 [2019-01-14 19:13:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:22,382 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-01-14 19:13:22,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:13:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-01-14 19:13:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 19:13:22,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:22,383 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:22,383 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2076316169, now seen corresponding path program 1 times [2019-01-14 19:13:22,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:22,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:13:22,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:22,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 19:13:22,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 19:13:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 19:13:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:13:22,796 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 14 states. [2019-01-14 19:13:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:23,614 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-01-14 19:13:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:13:23,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-01-14 19:13:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:23,617 INFO L225 Difference]: With dead ends: 117 [2019-01-14 19:13:23,617 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 19:13:23,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:13:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 19:13:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2019-01-14 19:13:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 19:13:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-14 19:13:23,622 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 46 [2019-01-14 19:13:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:23,622 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-14 19:13:23,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 19:13:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-14 19:13:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 19:13:23,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:23,626 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:23,626 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2118681012, now seen corresponding path program 1 times [2019-01-14 19:13:23,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:23,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:23,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 19:13:23,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:13:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:13:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:13:23,792 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 8 states. [2019-01-14 19:13:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:23,841 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-01-14 19:13:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:13:23,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-01-14 19:13:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:23,844 INFO L225 Difference]: With dead ends: 120 [2019-01-14 19:13:23,844 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 19:13:23,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:13:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 19:13:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-14 19:13:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 19:13:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2019-01-14 19:13:23,850 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 45 [2019-01-14 19:13:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:23,853 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2019-01-14 19:13:23,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:13:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2019-01-14 19:13:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 19:13:23,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:23,854 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:23,854 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -58708192, now seen corresponding path program 1 times [2019-01-14 19:13:23,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:23,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:24,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:13:24,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:13:24,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:24,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:13:24,504 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:13:24,515 INFO L478 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 10 treesize of output 9 [2019-01-14 19:13:24,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:24,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:24,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:24,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-14 19:13:25,061 WARN L860 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-14 19:13:25,068 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 19:13:25,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-14 19:13:25,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:25,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:25,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:13:25,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-01-14 19:13:25,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 19:13:25,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-14 19:13:25,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:25,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:25,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:25,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-01-14 19:13:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:13:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2019-01-14 19:13:25,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 19:13:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 19:13:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=569, Unknown=1, NotChecked=48, Total=702 [2019-01-14 19:13:25,326 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 27 states. [2019-01-14 19:13:29,168 WARN L181 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 19:13:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:30,306 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-01-14 19:13:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 19:13:30,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-01-14 19:13:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:30,309 INFO L225 Difference]: With dead ends: 116 [2019-01-14 19:13:30,309 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 19:13:30,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=4, NotChecked=78, Total=1722 [2019-01-14 19:13:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 19:13:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-14 19:13:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 19:13:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-01-14 19:13:30,314 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 47 [2019-01-14 19:13:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:30,315 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-01-14 19:13:30,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 19:13:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-01-14 19:13:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 19:13:30,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:30,319 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:30,319 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 655384003, now seen corresponding path program 1 times [2019-01-14 19:13:30,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:30,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:30,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:30,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:30,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:30,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:30,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 19:13:30,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:13:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:13:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:13:30,936 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 15 states. [2019-01-14 19:13:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:31,370 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-01-14 19:13:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:13:31,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-01-14 19:13:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:31,374 INFO L225 Difference]: With dead ends: 117 [2019-01-14 19:13:31,374 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 19:13:31,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-01-14 19:13:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 19:13:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-14 19:13:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 19:13:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2019-01-14 19:13:31,380 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 48 [2019-01-14 19:13:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:31,380 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2019-01-14 19:13:31,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:13:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2019-01-14 19:13:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 19:13:31,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:31,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:31,382 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1819953848, now seen corresponding path program 1 times [2019-01-14 19:13:31,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:31,787 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-14 19:13:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:32,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:13:32,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:13:32,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:32,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:13:32,218 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:13:32,221 INFO L478 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 10 treesize of output 9 [2019-01-14 19:13:32,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-14 19:13:32,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-01-14 19:13:32,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-14 19:13:32,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-14 19:13:32,804 WARN L860 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret38.base|))) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2019-01-14 19:13:32,830 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 19:13:32,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:13:32,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 19:13:32,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:32,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-14 19:13:33,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 19:13:33,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-01-14 19:13:33,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:33,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:33,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:33,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 19:13:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:33,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:13:33,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2019-01-14 19:13:33,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 19:13:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 19:13:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2019-01-14 19:13:33,122 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 26 states. [2019-01-14 19:13:35,610 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 19:13:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:36,150 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-01-14 19:13:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 19:13:36,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-01-14 19:13:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:36,153 INFO L225 Difference]: With dead ends: 120 [2019-01-14 19:13:36,154 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 19:13:36,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=4, NotChecked=72, Total=1482 [2019-01-14 19:13:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 19:13:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-01-14 19:13:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 19:13:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2019-01-14 19:13:36,158 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 48 [2019-01-14 19:13:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:36,159 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2019-01-14 19:13:36,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 19:13:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2019-01-14 19:13:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 19:13:36,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:36,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:36,163 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash -58082994, now seen corresponding path program 1 times [2019-01-14 19:13:36,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:36,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:36,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:13:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:13:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:13:36,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:13:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:13:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:13:36,279 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 5 states. [2019-01-14 19:13:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:13:36,288 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-01-14 19:13:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:13:36,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-14 19:13:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:13:36,291 INFO L225 Difference]: With dead ends: 121 [2019-01-14 19:13:36,291 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 19:13:36,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-14 19:13:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 19:13:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-01-14 19:13:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 19:13:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-01-14 19:13:36,295 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 47 [2019-01-14 19:13:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:13:36,295 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-01-14 19:13:36,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:13:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-01-14 19:13:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 19:13:36,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:13:36,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:13:36,298 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:13:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:13:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1255227170, now seen corresponding path program 1 times [2019-01-14 19:13:36,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:13:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:13:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:13:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:36,582 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 19:13:36,759 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-01-14 19:13:37,543 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2019-01-14 19:13:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:37,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:13:37,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:13:37,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:13:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:13:37,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:13:37,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2019-01-14 19:13:37,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 19:13:37,725 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:13:37,728 INFO L478 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 10 treesize of output 9 [2019-01-14 19:13:37,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:36 [2019-01-14 19:13:37,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 1 [2019-01-14 19:13:37,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-14 19:13:37,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-01-14 19:13:37,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:37,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2019-01-14 19:13:42,285 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 19:13:42,296 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 35 [2019-01-14 19:13:42,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:13:42,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2019-01-14 19:13:42,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:36 [2019-01-14 19:13:42,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-01-14 19:13:42,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 15 [2019-01-14 19:13:42,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:13:42,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:15 [2019-01-14 19:13:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:13:47,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:13:47,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-01-14 19:13:47,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 19:13:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 19:13:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=697, Unknown=17, NotChecked=0, Total=812 [2019-01-14 19:13:47,172 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 29 states. [2019-01-14 19:13:55,156 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 19:13:57,701 WARN L181 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-14 19:14:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:14:06,081 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-01-14 19:14:06,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:14:06,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-01-14 19:14:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:14:06,083 INFO L225 Difference]: With dead ends: 124 [2019-01-14 19:14:06,084 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 19:14:06,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=170, Invalid=1292, Unknown=20, NotChecked=0, Total=1482 [2019-01-14 19:14:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 19:14:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-01-14 19:14:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 19:14:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-01-14 19:14:06,096 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 46 [2019-01-14 19:14:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:14:06,096 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-01-14 19:14:06,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 19:14:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-01-14 19:14:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 19:14:06,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:14:06,102 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:14:06,103 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:14:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:14:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash -583994334, now seen corresponding path program 1 times [2019-01-14 19:14:06,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:14:06,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:14:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:14:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:14:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:14:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:14:06,434 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-14 19:14:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:14:06,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:14:06,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:14:06,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:14:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:14:06,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:14:06,991 INFO L478 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-01-14 19:14:06,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:06,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:06,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:14:07,017 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:14:07,019 INFO L478 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 10 treesize of output 9 [2019-01-14 19:14:07,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:07,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:07,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:07,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-14 19:14:08,634 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 19:14:08,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:08,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:08,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2019-01-14 19:14:08,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:08,673 INFO L478 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 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-14 19:14:08,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:08,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 19:14:08,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:08,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:08,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:08,725 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:27 [2019-01-14 19:14:09,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-01-14 19:14:09,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-14 19:14:09,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:09,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:09,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2019-01-14 19:14:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:14:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:14:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2019-01-14 19:14:09,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 19:14:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 19:14:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=945, Unknown=2, NotChecked=0, Total=1056 [2019-01-14 19:14:09,141 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 33 states. [2019-01-14 19:14:20,728 WARN L181 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-14 19:14:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:14:26,232 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-01-14 19:14:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 19:14:26,235 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2019-01-14 19:14:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:14:26,237 INFO L225 Difference]: With dead ends: 113 [2019-01-14 19:14:26,237 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 19:14:26,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=271, Invalid=2272, Unknown=7, NotChecked=0, Total=2550 [2019-01-14 19:14:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 19:14:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-01-14 19:14:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 19:14:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-01-14 19:14:26,243 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 49 [2019-01-14 19:14:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:14:26,243 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-01-14 19:14:26,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 19:14:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-01-14 19:14:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 19:14:26,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:14:26,244 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:14:26,244 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:14:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:14:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash -376346222, now seen corresponding path program 1 times [2019-01-14 19:14:26,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:14:26,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:14:26,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:14:26,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:14:26,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:14:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:14:27,258 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-01-14 19:14:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:14:27,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:14:27,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:14:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:14:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:14:27,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:14:27,670 INFO L478 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-01-14 19:14:27,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:27,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:27,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:14:27,849 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:14:27,853 INFO L478 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 10 treesize of output 9 [2019-01-14 19:14:27,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:27,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:27,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:27,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 19:14:39,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:39,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:39,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2019-01-14 19:14:39,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:39,204 INFO L478 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 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-14 19:14:39,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 19:14:39,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:39,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:39,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:14:39,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:35 [2019-01-14 19:14:39,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2019-01-14 19:14:39,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:39,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:39,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:18 [2019-01-14 19:14:43,556 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 19:14:43,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:43,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 19:14:43,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:14:43,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:43,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:35 [2019-01-14 19:14:44,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-14 19:14:44,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:44,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:14:44,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2019-01-14 19:14:44,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:44,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:44,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:14:44,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-01-14 19:14:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:14:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:14:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 32 [2019-01-14 19:14:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 19:14:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 19:14:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=957, Unknown=7, NotChecked=0, Total=1056 [2019-01-14 19:14:44,175 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 33 states. [2019-01-14 19:15:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:01,876 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-14 19:15:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 19:15:01,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-01-14 19:15:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:01,879 INFO L225 Difference]: With dead ends: 120 [2019-01-14 19:15:01,879 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 19:15:01,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=219, Invalid=2126, Unknown=7, NotChecked=0, Total=2352 [2019-01-14 19:15:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 19:15:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2019-01-14 19:15:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 19:15:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2019-01-14 19:15:01,885 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 51 [2019-01-14 19:15:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:01,885 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2019-01-14 19:15:01,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 19:15:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2019-01-14 19:15:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 19:15:01,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:01,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:01,886 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:01,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1137782281, now seen corresponding path program 1 times [2019-01-14 19:15:01,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:01,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:15:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:02,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 19:15:02,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:15:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:15:02,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:15:02,026 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 10 states. [2019-01-14 19:15:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:02,243 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-14 19:15:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:15:02,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-01-14 19:15:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:02,246 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:15:02,246 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:15:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:15:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:15:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-14 19:15:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 19:15:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-01-14 19:15:02,252 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 52 [2019-01-14 19:15:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:02,252 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-01-14 19:15:02,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:15:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-01-14 19:15:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 19:15:02,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:02,255 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:02,255 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1137782282, now seen corresponding path program 1 times [2019-01-14 19:15:02,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:02,803 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-14 19:15:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:15:02,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:02,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:15:02,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:15:02,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:15:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:15:02,913 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 8 states. [2019-01-14 19:15:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:03,000 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2019-01-14 19:15:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:15:03,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-01-14 19:15:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:03,004 INFO L225 Difference]: With dead ends: 108 [2019-01-14 19:15:03,004 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 19:15:03,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:15:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 19:15:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 19:15:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:15:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-01-14 19:15:03,010 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 52 [2019-01-14 19:15:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:03,010 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-01-14 19:15:03,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:15:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-01-14 19:15:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 19:15:03,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:03,014 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:03,014 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash 911512330, now seen corresponding path program 1 times [2019-01-14 19:15:03,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:15:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 19:15:03,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:15:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:15:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:15:03,398 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 15 states. [2019-01-14 19:15:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:03,674 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2019-01-14 19:15:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:15:03,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2019-01-14 19:15:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:03,678 INFO L225 Difference]: With dead ends: 107 [2019-01-14 19:15:03,678 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 19:15:03,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-14 19:15:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 19:15:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-14 19:15:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 19:15:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-01-14 19:15:03,682 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 53 [2019-01-14 19:15:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-01-14 19:15:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:15:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-01-14 19:15:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 19:15:03,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:03,683 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:03,683 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1807888791, now seen corresponding path program 1 times [2019-01-14 19:15:03,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:03,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:15:03,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:03,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 19:15:03,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:15:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:15:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:15:03,875 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 15 states. [2019-01-14 19:15:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:04,285 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2019-01-14 19:15:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:15:04,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-01-14 19:15:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:04,289 INFO L225 Difference]: With dead ends: 129 [2019-01-14 19:15:04,289 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 19:15:04,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-14 19:15:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 19:15:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-01-14 19:15:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 19:15:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-01-14 19:15:04,293 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 54 [2019-01-14 19:15:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:04,294 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-01-14 19:15:04,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:15:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-01-14 19:15:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 19:15:04,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:04,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:04,295 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash 476974664, now seen corresponding path program 1 times [2019-01-14 19:15:04,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:04,863 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-14 19:15:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:15:05,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:15:05,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:15:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:15:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:15:05,031 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 6 states. [2019-01-14 19:15:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:05,218 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-14 19:15:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:15:05,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-14 19:15:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:05,221 INFO L225 Difference]: With dead ends: 96 [2019-01-14 19:15:05,221 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 19:15:05,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:15:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 19:15:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-14 19:15:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 19:15:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-01-14 19:15:05,225 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 54 [2019-01-14 19:15:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:05,225 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-01-14 19:15:05,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:15:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-01-14 19:15:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 19:15:05,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:05,226 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:05,226 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash -209977620, now seen corresponding path program 1 times [2019-01-14 19:15:05,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:05,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:05,542 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2019-01-14 19:15:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:15:06,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:15:06,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:15:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:06,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:15:06,161 INFO L478 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-01-14 19:15:06,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:15:06,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:06,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:15:06,206 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 19:15:06,211 INFO L478 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 10 treesize of output 9 [2019-01-14 19:15:06,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:15:06,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:06,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:06,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-14 19:15:17,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:17,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:17,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2019-01-14 19:15:17,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:15:17,566 INFO L478 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 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-14 19:15:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:17,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 19:15:17,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:15:17,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:17,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:17,588 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:35 [2019-01-14 19:15:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:18,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-14 19:15:18,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:15:18,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:15:18,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:24 [2019-01-14 19:15:18,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2019-01-14 19:15:18,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:18,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-01-14 19:15:18,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:15:18,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:15:18,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:15:18,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-01-14 19:15:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:15:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:15:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 39 [2019-01-14 19:15:18,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 19:15:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 19:15:18,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1436, Unknown=6, NotChecked=0, Total=1560 [2019-01-14 19:15:18,258 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 40 states. [2019-01-14 19:15:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:19,917 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2019-01-14 19:15:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 19:15:19,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 55 [2019-01-14 19:15:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:19,921 INFO L225 Difference]: With dead ends: 96 [2019-01-14 19:15:19,921 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 19:15:19,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=251, Invalid=2823, Unknown=6, NotChecked=0, Total=3080 [2019-01-14 19:15:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 19:15:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-14 19:15:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 19:15:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2019-01-14 19:15:19,926 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 55 [2019-01-14 19:15:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:19,926 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2019-01-14 19:15:19,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 19:15:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2019-01-14 19:15:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 19:15:19,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:19,927 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:15:19,931 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -147208108, now seen corresponding path program 1 times [2019-01-14 19:15:19,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:20,375 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-01-14 19:15:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:15:20,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:15:20,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:15:20,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:20,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:15:20,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:15:20,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 19:15:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 19:15:20,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 19:15:20,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2019-01-14 19:15:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:15:21,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:15:21,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2019-01-14 19:15:21,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 19:15:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 19:15:21,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:15:21,408 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 25 states. [2019-01-14 19:15:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:22,693 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2019-01-14 19:15:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 19:15:22,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2019-01-14 19:15:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:22,697 INFO L225 Difference]: With dead ends: 96 [2019-01-14 19:15:22,697 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 19:15:22,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 19:15:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 19:15:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-01-14 19:15:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 19:15:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2019-01-14 19:15:22,701 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 59 [2019-01-14 19:15:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:22,701 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2019-01-14 19:15:22,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 19:15:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2019-01-14 19:15:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 19:15:22,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:22,702 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:15:22,702 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash -267858814, now seen corresponding path program 1 times [2019-01-14 19:15:22,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:22,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:22,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:15:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:15:23,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:15:23,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 19:15:23,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:15:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:15:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:15:23,053 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 8 states. [2019-01-14 19:15:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:15:23,089 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-01-14 19:15:23,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:15:23,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-01-14 19:15:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:15:23,091 INFO L225 Difference]: With dead ends: 95 [2019-01-14 19:15:23,091 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 19:15:23,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:15:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 19:15:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-14 19:15:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 19:15:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-01-14 19:15:23,098 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 60 [2019-01-14 19:15:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:15:23,098 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-01-14 19:15:23,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:15:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-01-14 19:15:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 19:15:23,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:15:23,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:15:23,099 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-14 19:15:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:15:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -315094442, now seen corresponding path program 1 times [2019-01-14 19:15:23,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:15:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:15:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:23,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:15:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:15:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:15:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:15:23,170 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 19:15:23,210 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:15:23,219 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:15:23,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:15:23 BoogieIcfgContainer [2019-01-14 19:15:23,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:15:23,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:15:23,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:15:23,250 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:15:23,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:12:34" (3/4) ... [2019-01-14 19:15:23,256 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 19:15:23,269 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:15:23,269 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:15:23,319 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:15:23,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:15:23,320 INFO L168 Benchmark]: Toolchain (without parser) took 171577.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 183.3 MB. Max. memory is 11.5 GB. [2019-01-14 19:15:23,322 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:15:23,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:15:23,323 INFO L168 Benchmark]: Boogie Preprocessor took 117.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:15:23,323 INFO L168 Benchmark]: RCFGBuilder took 2300.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:15:23,327 INFO L168 Benchmark]: TraceAbstraction took 168263.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 992.7 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:15:23,328 INFO L168 Benchmark]: Witness Printer took 69.54 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:15:23,333 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 821.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2300.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168263.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 992.7 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.54 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1478]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-6:0}] [L1492] CALL entry_point() VAL [ldv_global_msg_list={-6:0}] [L1483] struct A19 a19; VAL [a19={-5:0}, ldv_global_msg_list={-6:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={-5:0}, ldv_global_msg_list={-6:0}] [L1455] int ret = - -3; VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-6:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-1:0}, ldv_global_msg_list={-6:0}, malloc(size)={-1:0}, size=4] [L1457] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ldv_malloc(sizeof(int))={-1:0}, ret=3] [L1457] a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ldv_malloc(sizeof(int))={-1:0}, ret=3] [L1458] EXPR a->q VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}, ret=3] [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) VAL [a={-5:0}, ldv_global_msg_list={-6:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-6:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-3:0}, ldv_global_msg_list={-6:0}, malloc(size)={-3:0}, size=4] [L1440] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ldv_malloc(sizeof(int))={-3:0}] [L1440] a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ldv_malloc(sizeof(int))={-3:0}] [L1441] a->p VAL [a={-5:0}, a={-5:0}, a->p={-3:0}, ldv_global_msg_list={-6:0}] [L1441] COND TRUE a->p [L1442] return 0; VAL [\result=0, a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}] [L1460] RET, EXPR f19(a) VAL [a={-5:0}, a={-5:0}, f19(a)=0, ldv_global_msg_list={-6:0}, ret=3] [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ret=0] [L1464] CALL, EXPR g19() VAL [ldv_global_msg_list={-6:0}] [L1451] return __VERIFIER_nondet_int(); [L1464] RET, EXPR g19() VAL [a={-5:0}, a={-5:0}, g19()=0, ldv_global_msg_list={-6:0}, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={-5:0}, ldv_global_msg_list={-6:0}] [L1447] EXPR a->p VAL [a={-5:0}, a={-5:0}, a->p={-3:0}, ldv_global_msg_list={-6:0}] [L1447] free(a->p) VAL [a={-5:0}, a={-5:0}, a->p={-3:0}, ldv_global_msg_list={-6:0}] [L1447] free(a->p) VAL [a={-5:0}, a={-5:0}, a->p={-3:0}, ldv_global_msg_list={-6:0}] [L1447] free(a->p) [L1470] RET f19_undo(a) VAL [a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ret=0] [L1472] EXPR a->q VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}, ret=0] [L1472] free(a->q) VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}, ret=0] [L1472] free(a->q) VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}, ret=0] [L1472] free(a->q) [L1474] return ret; VAL [\result=0, a={-5:0}, a={-5:0}, ldv_global_msg_list={-6:0}, ret=0] [L1484] RET, EXPR probe_unsafe_19(&a19) VAL [a19={-5:0}, ldv_global_msg_list={-6:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 VAL [a19={-5:0}, ldv_global_msg_list={-6:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={-5:0}, ldv_global_msg_list={-6:0}] [L1478] EXPR a->q VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}] [L1478] free(a->q) VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}] [L1478] free(a->q) VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}] [L1478] free(a->q) VAL [a={-5:0}, a={-5:0}, a->q={-1:0}, ldv_global_msg_list={-6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 48 procedures, 389 locations, 94 error locations. UNSAFE Result, 168.2s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 99.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2957 SDtfs, 2700 SDslu, 15286 SDs, 0 SdLazy, 13175 SolverSat, 793 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 70.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 453 SyntacticMatches, 22 SemanticMatches, 683 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4260 ImplicationChecksByTransitivity, 88.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 334 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 65.9s InterpolantComputationTime, 2178 NumberOfCodeBlocks, 2178 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2066 ConstructedInterpolants, 114 QuantifiedInterpolants, 730468 SizeOfPredicates, 110 NumberOfNonLiveVariables, 2724 ConjunctsInSsa, 355 ConjunctsInUnsatCore, 50 InterpolantComputations, 34 PerfectInterpolantSequences, 144/176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...