./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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_test11_1_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 41595dc52c6906fb55de72b138967114013fb2be ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-2e94e6a [2019-01-01 18:14:24,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 18:14:24,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 18:14:24,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 18:14:24,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 18:14:24,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 18:14:24,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 18:14:24,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 18:14:24,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 18:14:24,664 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 18:14:24,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 18:14:24,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 18:14:24,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 18:14:24,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 18:14:24,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 18:14:24,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 18:14:24,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 18:14:24,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 18:14:24,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 18:14:24,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 18:14:24,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 18:14:24,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 18:14:24,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 18:14:24,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 18:14:24,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 18:14:24,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 18:14:24,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 18:14:24,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 18:14:24,687 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 18:14:24,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 18:14:24,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 18:14:24,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 18:14:24,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 18:14:24,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 18:14:24,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 18:14:24,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 18:14:24,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 18:14:24,710 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 18:14:24,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 18:14:24,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 18:14:24,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 18:14:24,718 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 18:14:24,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 18:14:24,719 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 18:14:24,720 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 18:14:24,720 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 18:14:24,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 18:14:24,720 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 18:14:24,720 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 18:14:24,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 18:14:24,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 18:14:24,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 18:14:24,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 18:14:24,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:14:24,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 18:14:24,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 18:14:24,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 18:14:24,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 18:14:24,725 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 -> 41595dc52c6906fb55de72b138967114013fb2be [2019-01-01 18:14:24,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 18:14:24,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 18:14:24,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 18:14:24,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 18:14:24,810 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 18:14:24,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2019-01-01 18:14:24,880 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f5514a4/b5d653e6134b4eaf9122debf611d44d3/FLAG84d2d6a14 [2019-01-01 18:14:25,423 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 18:14:25,424 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2019-01-01 18:14:25,443 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f5514a4/b5d653e6134b4eaf9122debf611d44d3/FLAG84d2d6a14 [2019-01-01 18:14:25,694 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f5514a4/b5d653e6134b4eaf9122debf611d44d3 [2019-01-01 18:14:25,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 18:14:25,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 18:14:25,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 18:14:25,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 18:14:25,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 18:14:25,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:14:25" (1/1) ... [2019-01-01 18:14:25,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130ad7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:25, skipping insertion in model container [2019-01-01 18:14:25,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:14:25" (1/1) ... [2019-01-01 18:14:25,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 18:14:25,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 18:14:26,280 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:14:26,316 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 18:14:26,532 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:14:26,659 INFO L195 MainTranslator]: Completed translation [2019-01-01 18:14:26,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26 WrapperNode [2019-01-01 18:14:26,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 18:14:26,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 18:14:26,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 18:14:26,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 18:14:26,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... [2019-01-01 18:14:26,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 18:14:26,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 18:14:26,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 18:14:26,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 18:14:26,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:14:26,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 18:14:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 18:14:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:14:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-01 18:14:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-01 18:14:26,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-01 18:14:26,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-01 18:14:26,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-01 18:14:26,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-01 18:14:26,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-01 18:14:26,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-01 18:14:26,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-01 18:14:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2019-01-01 18:14:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_2_11 [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-01 18:14:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-01 18:14:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 18:14:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 18:14:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 18:14:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 18:14:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 18:14:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 18:14:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 18:14:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 18:14:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 18:14:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 18:14:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 18:14:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 18:14:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 18:14:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-01 18:14:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:14:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-01 18:14:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-01 18:14:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-01 18:14:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-01 18:14:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_2_11 [2019-01-01 18:14:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-01 18:14:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-01 18:14:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-01 18:14:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-01 18:14:27,550 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:14:28,471 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:14:29,107 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 18:14:29,107 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 18:14:29,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:14:29 BoogieIcfgContainer [2019-01-01 18:14:29,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 18:14:29,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 18:14:29,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 18:14:29,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 18:14:29,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 06:14:25" (1/3) ... [2019-01-01 18:14:29,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725f76f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:14:29, skipping insertion in model container [2019-01-01 18:14:29,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:14:26" (2/3) ... [2019-01-01 18:14:29,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725f76f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:14:29, skipping insertion in model container [2019-01-01 18:14:29,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:14:29" (3/3) ... [2019-01-01 18:14:29,116 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1_false-valid-free.i [2019-01-01 18:14:29,124 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 18:14:29,133 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 96 error locations. [2019-01-01 18:14:29,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2019-01-01 18:14:29,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 18:14:29,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 18:14:29,179 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 18:14:29,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 18:14:29,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 18:14:29,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 18:14:29,179 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 18:14:29,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 18:14:29,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 18:14:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-01-01 18:14:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 18:14:29,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:29,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:29,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1764076599, now seen corresponding path program 1 times [2019-01-01 18:14:29,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:29,651 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-01 18:14:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:14:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:14:29,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:14:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:14:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:29,682 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 5 states. [2019-01-01 18:14:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:30,224 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2019-01-01 18:14:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:14:30,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 18:14:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:30,247 INFO L225 Difference]: With dead ends: 151 [2019-01-01 18:14:30,247 INFO L226 Difference]: Without dead ends: 148 [2019-01-01 18:14:30,249 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-01 18:14:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-01 18:14:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2019-01-01 18:14:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:14:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-01-01 18:14:30,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 16 [2019-01-01 18:14:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:30,322 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-01-01 18:14:30,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:14:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-01-01 18:14:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 18:14:30,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:30,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:30,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash -788080362, now seen corresponding path program 1 times [2019-01-01 18:14:30,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:30,441 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-01 18:14:30,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:14:30,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:14:30,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:14:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:14:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:14:30,445 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 3 states. [2019-01-01 18:14:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:30,943 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2019-01-01 18:14:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:14:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-01 18:14:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:30,947 INFO L225 Difference]: With dead ends: 168 [2019-01-01 18:14:30,947 INFO L226 Difference]: Without dead ends: 165 [2019-01-01 18:14:30,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:14:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-01 18:14:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2019-01-01 18:14:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 18:14:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-01-01 18:14:30,962 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 16 [2019-01-01 18:14:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:30,963 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-01-01 18:14:30,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:14:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-01-01 18:14:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:14:30,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:30,964 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:30,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash 408459418, now seen corresponding path program 1 times [2019-01-01 18:14:30,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:30,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:30,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:30,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:31,060 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-01 18:14:31,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:14:31,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:14:31,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:14:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:14:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:31,061 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 5 states. [2019-01-01 18:14:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:31,130 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2019-01-01 18:14:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:14:31,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 18:14:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:31,139 INFO L225 Difference]: With dead ends: 145 [2019-01-01 18:14:31,141 INFO L226 Difference]: Without dead ends: 145 [2019-01-01 18:14:31,142 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-01 18:14:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-01 18:14:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2019-01-01 18:14:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:14:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-01-01 18:14:31,155 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 21 [2019-01-01 18:14:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:31,155 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-01-01 18:14:31,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:14:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-01-01 18:14:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:14:31,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:31,157 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:31,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 408459451, now seen corresponding path program 1 times [2019-01-01 18:14:31,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:31,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:31,376 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-01 18:14:31,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:31,377 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-01 18:14:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:31,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:31,495 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-01 18:14:31,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:14:31,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:14:31,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:14:31,861 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2019-01-01 18:14:31,876 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 12 treesize of output 11 [2019-01-01 18:14:31,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:14:31,888 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 1 xjuncts. [2019-01-01 18:14:31,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-01 18:14:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-01 18:14:31,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:14:31,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 18:14:31,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:14:31,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:14:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2019-01-01 18:14:31,929 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 8 states. [2019-01-01 18:14:32,925 WARN L181 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-01 18:14:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:34,489 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-01-01 18:14:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:14:34,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-01 18:14:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:34,495 INFO L225 Difference]: With dead ends: 215 [2019-01-01 18:14:34,495 INFO L226 Difference]: Without dead ends: 215 [2019-01-01 18:14:34,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2019-01-01 18:14:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-01 18:14:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 125. [2019-01-01 18:14:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 18:14:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-01-01 18:14:34,513 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 21 [2019-01-01 18:14:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:34,514 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-01-01 18:14:34,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:14:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-01-01 18:14:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:14:34,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:34,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:34,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash 408459452, now seen corresponding path program 1 times [2019-01-01 18:14:34,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:34,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:34,820 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-01 18:14:34,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:34,820 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-01 18:14:34,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:34,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:34,894 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-01 18:14:34,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:14:34,905 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-01 18:14:34,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-01 18:14:35,413 WARN L860 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc12.base| Int)) (and (<= |c_ldv_malloc_#in~size| ldv_malloc_~size) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)))) is different from true [2019-01-01 18:14:35,485 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 12 treesize of output 18 [2019-01-01 18:14:35,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-01 18:14:35,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 18:14:35,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:24 [2019-01-01 18:14:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-01 18:14:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:14:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-01-01 18:14:35,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 18:14:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 18:14:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=147, Unknown=1, NotChecked=24, Total=210 [2019-01-01 18:14:35,635 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 15 states. [2019-01-01 18:14:36,598 WARN L181 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-01 18:14:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:38,391 INFO L93 Difference]: Finished difference Result 321 states and 376 transitions. [2019-01-01 18:14:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:14:38,393 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-01-01 18:14:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:38,398 INFO L225 Difference]: With dead ends: 321 [2019-01-01 18:14:38,399 INFO L226 Difference]: Without dead ends: 321 [2019-01-01 18:14:38,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2019-01-01 18:14:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-01 18:14:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 154. [2019-01-01 18:14:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-01 18:14:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 196 transitions. [2019-01-01 18:14:38,421 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 196 transitions. Word has length 21 [2019-01-01 18:14:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:38,421 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 196 transitions. [2019-01-01 18:14:38,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 18:14:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 196 transitions. [2019-01-01 18:14:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:14:38,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:38,422 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:38,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 115056444, now seen corresponding path program 1 times [2019-01-01 18:14:38,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:38,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:38,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:38,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:38,530 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-01 18:14:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:38,530 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-01 18:14:38,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:38,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:38,631 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-01 18:14:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:14:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-01-01 18:14:38,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:14:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:14:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:38,652 INFO L87 Difference]: Start difference. First operand 154 states and 196 transitions. Second operand 5 states. [2019-01-01 18:14:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:38,674 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2019-01-01 18:14:38,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:14:38,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 18:14:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:38,676 INFO L225 Difference]: With dead ends: 141 [2019-01-01 18:14:38,676 INFO L226 Difference]: Without dead ends: 139 [2019-01-01 18:14:38,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-01 18:14:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-01 18:14:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-01 18:14:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2019-01-01 18:14:38,687 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 21 [2019-01-01 18:14:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:38,687 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2019-01-01 18:14:38,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:14:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2019-01-01 18:14:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 18:14:38,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:38,688 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] [2019-01-01 18:14:38,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash 664844207, now seen corresponding path program 1 times [2019-01-01 18:14:38,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:38,763 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-01 18:14:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:38,764 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-01 18:14:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:38,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:38,801 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-01 18:14:38,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:14:38,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 18:14:38,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:14:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:14:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:38,825 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand 5 states. [2019-01-01 18:14:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:39,221 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2019-01-01 18:14:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:14:39,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-01 18:14:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:39,224 INFO L225 Difference]: With dead ends: 138 [2019-01-01 18:14:39,224 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 18:14:39,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-01 18:14:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 18:14:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-01-01 18:14:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 18:14:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2019-01-01 18:14:39,232 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 22 [2019-01-01 18:14:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:39,233 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2019-01-01 18:14:39,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:14:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2019-01-01 18:14:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:14:39,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:39,234 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] [2019-01-01 18:14:39,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1961260923, now seen corresponding path program 1 times [2019-01-01 18:14:39,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:39,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:39,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:39,378 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-01 18:14:39,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:39,379 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-01 18:14:39,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:39,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:41,430 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-01 18:14:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:14:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-01-01 18:14:41,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:14:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:14:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=63, Unknown=6, NotChecked=0, Total=90 [2019-01-01 18:14:41,450 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand 10 states. [2019-01-01 18:14:48,257 WARN L181 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-01 18:14:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:58,767 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2019-01-01 18:14:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:14:58,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-01 18:14:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:58,773 INFO L225 Difference]: With dead ends: 172 [2019-01-01 18:14:58,773 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 18:14:58,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=26, Invalid=78, Unknown=6, NotChecked=0, Total=110 [2019-01-01 18:14:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 18:14:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 133. [2019-01-01 18:14:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-01 18:14:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2019-01-01 18:14:58,784 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 26 [2019-01-01 18:14:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:58,785 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2019-01-01 18:14:58,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:14:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2019-01-01 18:14:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 18:14:58,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:58,786 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:58,789 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1032356409, now seen corresponding path program 1 times [2019-01-01 18:14:58,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:58,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:58,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:14:58,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:14:58,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:14:58,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:14:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:14:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:14:58,972 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 5 states. [2019-01-01 18:14:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:14:59,075 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2019-01-01 18:14:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:14:59,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-01 18:14:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:14:59,077 INFO L225 Difference]: With dead ends: 154 [2019-01-01 18:14:59,077 INFO L226 Difference]: Without dead ends: 154 [2019-01-01 18:14:59,078 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-01 18:14:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-01 18:14:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2019-01-01 18:14:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-01 18:14:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2019-01-01 18:14:59,085 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 29 [2019-01-01 18:14:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:14:59,085 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2019-01-01 18:14:59,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:14:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2019-01-01 18:14:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 18:14:59,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:14:59,086 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:14:59,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:14:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:14:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1032356359, now seen corresponding path program 1 times [2019-01-01 18:14:59,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:14:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:14:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:14:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:14:59,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:14:59,229 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-01 18:14:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:14:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:14:59,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:14:59,301 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-01 18:14:59,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:14:59,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:14:59,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:14:59,653 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2019-01-01 18:14:59,668 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 12 treesize of output 11 [2019-01-01 18:14:59,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:14:59,676 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 1 xjuncts. [2019-01-01 18:14:59,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-01 18:14:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-01-01 18:14:59,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:14:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 18:14:59,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:14:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:14:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2019-01-01 18:14:59,797 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand 8 states. [2019-01-01 18:15:00,614 WARN L181 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-01 18:15:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:01,123 INFO L93 Difference]: Finished difference Result 190 states and 231 transitions. [2019-01-01 18:15:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:15:01,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-01 18:15:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:01,127 INFO L225 Difference]: With dead ends: 190 [2019-01-01 18:15:01,127 INFO L226 Difference]: Without dead ends: 190 [2019-01-01 18:15:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2019-01-01 18:15:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-01 18:15:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2019-01-01 18:15:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-01 18:15:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2019-01-01 18:15:01,136 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 29 [2019-01-01 18:15:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:01,136 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2019-01-01 18:15:01,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:15:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2019-01-01 18:15:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 18:15:01,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:01,138 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:15:01,139 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:01,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1032356358, now seen corresponding path program 1 times [2019-01-01 18:15:01,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:01,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 18:15:01,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:01,410 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-01 18:15:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:01,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:01,473 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-01 18:15:01,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:01,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:01,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:15:01,895 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2019-01-01 18:15:01,904 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 12 treesize of output 11 [2019-01-01 18:15:01,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:01,911 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 1 xjuncts. [2019-01-01 18:15:01,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-01 18:15:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-01-01 18:15:01,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:01,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-01 18:15:01,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 18:15:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 18:15:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2019-01-01 18:15:01,947 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand 16 states. [2019-01-01 18:15:02,812 WARN L181 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 18:15:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:03,820 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2019-01-01 18:15:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:15:03,822 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-01-01 18:15:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:03,824 INFO L225 Difference]: With dead ends: 219 [2019-01-01 18:15:03,824 INFO L226 Difference]: Without dead ends: 219 [2019-01-01 18:15:03,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2019-01-01 18:15:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-01 18:15:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 160. [2019-01-01 18:15:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-01 18:15:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2019-01-01 18:15:03,833 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 29 [2019-01-01 18:15:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:03,833 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2019-01-01 18:15:03,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 18:15:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2019-01-01 18:15:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 18:15:03,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:03,835 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:15:03,836 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1537914984, now seen corresponding path program 1 times [2019-01-01 18:15:03,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:03,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:15:04,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:04,041 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-01 18:15:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:04,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:15:04,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:15:04,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-01-01 18:15:04,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:15:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:15:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:15:04,159 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand 5 states. [2019-01-01 18:15:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:04,195 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2019-01-01 18:15:04,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:15:04,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-01 18:15:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:04,197 INFO L225 Difference]: With dead ends: 135 [2019-01-01 18:15:04,198 INFO L226 Difference]: Without dead ends: 133 [2019-01-01 18:15:04,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:15:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-01 18:15:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-01 18:15:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-01 18:15:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2019-01-01 18:15:04,212 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 29 [2019-01-01 18:15:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2019-01-01 18:15:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:15:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2019-01-01 18:15:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 18:15:04,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:04,217 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:15:04,218 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1050773477, now seen corresponding path program 1 times [2019-01-01 18:15:04,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:04,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:04,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:04,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:04,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:15:04,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:04,311 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-01 18:15:04,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:04,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:15:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 18:15:04,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:15:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:15:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:15:04,380 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand 5 states. [2019-01-01 18:15:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:04,498 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2019-01-01 18:15:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:15:04,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-01 18:15:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:04,503 INFO L225 Difference]: With dead ends: 132 [2019-01-01 18:15:04,503 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 18:15:04,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:15:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 18:15:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-01 18:15:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 18:15:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2019-01-01 18:15:04,508 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 30 [2019-01-01 18:15:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:04,509 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2019-01-01 18:15:04,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:15:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2019-01-01 18:15:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 18:15:04,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:04,510 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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-01 18:15:04,511 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993199, now seen corresponding path program 1 times [2019-01-01 18:15:04,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:04,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:04,963 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:15:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:15:05,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:15:05,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:15:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 18:15:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 18:15:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 18:15:05,204 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand 7 states. [2019-01-01 18:15:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:05,577 INFO L93 Difference]: Finished difference Result 155 states and 183 transitions. [2019-01-01 18:15:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:15:05,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-01-01 18:15:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:05,583 INFO L225 Difference]: With dead ends: 155 [2019-01-01 18:15:05,583 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 18:15:05,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:15:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 18:15:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2019-01-01 18:15:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-01 18:15:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2019-01-01 18:15:05,590 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 32 [2019-01-01 18:15:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:05,590 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2019-01-01 18:15:05,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 18:15:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2019-01-01 18:15:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 18:15:05,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:05,592 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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-01 18:15:05,593 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993200, now seen corresponding path program 1 times [2019-01-01 18:15:05,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:05,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:15:05,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:05,881 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-01 18:15:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:05,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:06,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:06,038 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 14 treesize of output 17 [2019-01-01 18:15:06,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:06,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:06,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:06,087 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:15:06,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:06,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:06,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-01-01 18:15:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:15:06,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:15:06,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-01-01 18:15:06,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 18:15:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 18:15:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-01-01 18:15:06,172 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand 16 states. [2019-01-01 18:15:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:07,294 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2019-01-01 18:15:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:15:07,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-01-01 18:15:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:07,298 INFO L225 Difference]: With dead ends: 155 [2019-01-01 18:15:07,298 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 18:15:07,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-01-01 18:15:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 18:15:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 107. [2019-01-01 18:15:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 18:15:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-01-01 18:15:07,307 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 32 [2019-01-01 18:15:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:07,307 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-01-01 18:15:07,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 18:15:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-01-01 18:15:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 18:15:07,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:07,311 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 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-01 18:15:07,317 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:07,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1106219664, now seen corresponding path program 1 times [2019-01-01 18:15:07,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:07,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:15:07,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:07,627 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-01 18:15:07,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:07,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:07,677 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-01 18:15:07,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:15:07,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:07,698 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:15:07,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-01 18:15:07,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:15:07,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-01 18:15:07,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:07,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-01 18:15:09,808 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_4 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_8 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_8 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_8) v_entry_point_~c11~0.offset_BEFORE_CALL_4)))) is different from true [2019-01-01 18:15:09,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-01-01 18:15:09,880 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 12 treesize of output 11 [2019-01-01 18:15:09,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:09,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:09,903 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-01 18:15:09,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2019-01-01 18:15:10,051 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 25 treesize of output 19 [2019-01-01 18:15:10,067 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 19 treesize of output 10 [2019-01-01 18:15:10,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:10,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:10,080 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-01 18:15:10,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-01-01 18:15:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-01-01 18:15:10,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:10,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2019-01-01 18:15:10,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 18:15:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 18:15:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=270, Unknown=1, NotChecked=32, Total=342 [2019-01-01 18:15:10,168 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 19 states. [2019-01-01 18:15:14,668 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:15:18,691 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 18:15:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:21,491 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-01-01 18:15:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:15:21,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-01-01 18:15:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:21,494 INFO L225 Difference]: With dead ends: 143 [2019-01-01 18:15:21,494 INFO L226 Difference]: Without dead ends: 143 [2019-01-01 18:15:21,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=4, NotChecked=56, Total=930 [2019-01-01 18:15:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-01 18:15:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 113. [2019-01-01 18:15:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 18:15:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-01-01 18:15:21,501 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 34 [2019-01-01 18:15:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:21,501 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-01-01 18:15:21,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 18:15:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-01-01 18:15:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 18:15:21,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:21,502 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 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-01 18:15:21,503 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1106219665, now seen corresponding path program 1 times [2019-01-01 18:15:21,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:21,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:21,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:21,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:15:21,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:21,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:15:21,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:21,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:21,846 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-01 18:15:21,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:21,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:21,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:15:21,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:21,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:21,896 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:15:21,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:21,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:21,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-01 18:15:21,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:15:22,000 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 8 treesize of output 7 [2019-01-01 18:15:22,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:22,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:22,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:15:22,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-01 18:15:22,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:22,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:22,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:22,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-01-01 18:15:24,050 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_11 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_6 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_11) v_entry_point_~c11~0.offset_BEFORE_CALL_6)))) is different from true [2019-01-01 18:15:24,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2019-01-01 18:15:24,117 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 16 treesize of output 15 [2019-01-01 18:15:24,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2019-01-01 18:15:24,150 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 16 treesize of output 15 [2019-01-01 18:15:24,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,169 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-01 18:15:24,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:31 [2019-01-01 18:15:24,261 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-01 18:15:24,264 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 16 [2019-01-01 18:15:24,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-01 18:15:24,282 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 20 treesize of output 11 [2019-01-01 18:15:24,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:24,297 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-01 18:15:24,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-01-01 18:15:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-01-01 18:15:24,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:24,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2019-01-01 18:15:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 18:15:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 18:15:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=501, Unknown=1, NotChecked=44, Total=600 [2019-01-01 18:15:24,370 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 25 states. [2019-01-01 18:15:28,605 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:15:32,642 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 18:15:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:34,063 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2019-01-01 18:15:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 18:15:34,064 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-01-01 18:15:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:34,066 INFO L225 Difference]: With dead ends: 142 [2019-01-01 18:15:34,066 INFO L226 Difference]: Without dead ends: 142 [2019-01-01 18:15:34,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=149, Invalid=1112, Unknown=3, NotChecked=68, Total=1332 [2019-01-01 18:15:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-01 18:15:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 112. [2019-01-01 18:15:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 18:15:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-01 18:15:34,074 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 34 [2019-01-01 18:15:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:34,077 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-01 18:15:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 18:15:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-01 18:15:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 18:15:34,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:34,080 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-01 18:15:34,080 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1827528214, now seen corresponding path program 1 times [2019-01-01 18:15:34,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:34,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:34,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 18:15:34,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:34,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:15:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:34,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:15:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-01-01 18:15:41,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 18:15:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 18:15:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=323, Unknown=8, NotChecked=0, Total=380 [2019-01-01 18:15:41,062 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 20 states. [2019-01-01 18:15:46,788 WARN L181 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-01-01 18:15:48,141 WARN L181 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2019-01-01 18:15:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:15:51,360 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-01-01 18:15:51,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:15:51,361 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-01-01 18:15:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:15:51,362 INFO L225 Difference]: With dead ends: 143 [2019-01-01 18:15:51,362 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 18:15:51,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=96, Invalid=652, Unknown=8, NotChecked=0, Total=756 [2019-01-01 18:15:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 18:15:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2019-01-01 18:15:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 18:15:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-01-01 18:15:51,367 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 37 [2019-01-01 18:15:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:15:51,370 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-01-01 18:15:51,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 18:15:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-01-01 18:15:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 18:15:51,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:15:51,371 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-01 18:15:51,372 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:15:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:15:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1345234367, now seen corresponding path program 1 times [2019-01-01 18:15:51,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:15:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:15:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:51,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:51,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:15:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 18:15:51,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:15:51,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:15:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:15:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:15:51,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:15:51,925 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-01 18:15:51,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:51,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:51,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:15:51,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:51,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:15:51,970 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:15:51,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:51,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:51,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-01 18:15:51,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:15:51,992 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 8 treesize of output 7 [2019-01-01 18:15:51,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:51,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:52,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:15:52,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-01 18:15:52,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:52,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:52,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:52,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-01-01 18:15:54,028 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_16 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_10 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_16 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_16) v_entry_point_~c11~0.offset_BEFORE_CALL_10)))) is different from true [2019-01-01 18:15:54,038 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-01 18:15:54,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:54,044 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-01 18:15:54,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2019-01-01 18:15:58,080 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 18:15:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 18:15:58,210 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 12 treesize of output 15 [2019-01-01 18:15:58,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2019-01-01 18:15:58,257 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 8 treesize of output 11 [2019-01-01 18:15:58,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:62, output treesize:26 [2019-01-01 18:15:58,385 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 25 treesize of output 21 [2019-01-01 18:15:58,388 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 21 treesize of output 13 [2019-01-01 18:15:58,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:15:58,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-01-01 18:15:58,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-01 18:15:58,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-01 18:15:58,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,614 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 13 treesize of output 5 [2019-01-01 18:15:58,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2019-01-01 18:15:58,968 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2019-01-01 18:15:58,973 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 12 treesize of output 11 [2019-01-01 18:15:58,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:15:58,978 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 1 xjuncts. [2019-01-01 18:15:58,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-01 18:15:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2019-01-01 18:15:59,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:15:59,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 27 [2019-01-01 18:15:59,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 18:15:59,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 18:15:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=590, Unknown=3, NotChecked=98, Total=756 [2019-01-01 18:15:59,025 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 28 states. [2019-01-01 18:16:09,392 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:16:15,496 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-01-01 18:16:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:19,592 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2019-01-01 18:16:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 18:16:19,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2019-01-01 18:16:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:19,596 INFO L225 Difference]: With dead ends: 158 [2019-01-01 18:16:19,596 INFO L226 Difference]: Without dead ends: 158 [2019-01-01 18:16:19,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=227, Invalid=1844, Unknown=7, NotChecked=178, Total=2256 [2019-01-01 18:16:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-01 18:16:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2019-01-01 18:16:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-01 18:16:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2019-01-01 18:16:19,604 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 43 [2019-01-01 18:16:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:19,605 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2019-01-01 18:16:19,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 18:16:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2019-01-01 18:16:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 18:16:19,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:19,606 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-01 18:16:19,608 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:16:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1345234368, now seen corresponding path program 1 times [2019-01-01 18:16:19,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 18:16:20,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:16:20,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:16:20,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:16:20,237 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-01 18:16:20,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:16:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:16:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:16:20,251 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:16:20,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-01 18:16:20,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:16:20,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-01 18:16:20,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 18:16:20,305 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 8 treesize of output 7 [2019-01-01 18:16:20,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:20,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-01-01 18:16:22,315 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_19 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_19 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_19) v_entry_point_~c11~0.offset_BEFORE_CALL_12)))) is different from true [2019-01-01 18:16:25,268 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:16:25,271 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-01 18:16:25,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:25,283 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-01 18:16:25,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:25,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:16:25,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:22 [2019-01-01 18:16:28,043 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 18:16:28,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 18:16:28,145 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 8 treesize of output 11 [2019-01-01 18:16:28,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2019-01-01 18:16:28,179 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 12 treesize of output 15 [2019-01-01 18:16:28,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,205 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:58 [2019-01-01 18:16:28,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2019-01-01 18:16:28,456 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 32 treesize of output 11 [2019-01-01 18:16:28,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,470 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2019-01-01 18:16:28,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:16:28,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:16:28,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 18:16:28,598 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-01 18:16:28,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:28,613 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-01 18:16:28,613 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:88, output treesize:14 [2019-01-01 18:16:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:16:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:16:29,055 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:16:29,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:29,065 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 12 treesize of output 15 [2019-01-01 18:16:29,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:29,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:29,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:16:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-01 18:16:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:16:29,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 32 [2019-01-01 18:16:29,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 18:16:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 18:16:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=4, NotChecked=60, Total=1056 [2019-01-01 18:16:29,105 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 33 states. [2019-01-01 18:16:39,232 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 18:16:51,800 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 18:16:54,679 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 18:16:59,189 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 18:17:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:04,141 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2019-01-01 18:17:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 18:17:04,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-01-01 18:17:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:04,145 INFO L225 Difference]: With dead ends: 178 [2019-01-01 18:17:04,145 INFO L226 Difference]: Without dead ends: 178 [2019-01-01 18:17:04,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=255, Invalid=2389, Unknown=12, NotChecked=100, Total=2756 [2019-01-01 18:17:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-01 18:17:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2019-01-01 18:17:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 18:17:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2019-01-01 18:17:04,154 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 43 [2019-01-01 18:17:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:04,154 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2019-01-01 18:17:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 18:17:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2019-01-01 18:17:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 18:17:04,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:04,160 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:04,160 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 936410142, now seen corresponding path program 1 times [2019-01-01 18:17:04,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:04,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:04,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:04,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:04,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:04,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:17:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:17:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-01-01 18:17:04,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:04,669 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 5 states. [2019-01-01 18:17:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:04,836 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2019-01-01 18:17:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:04,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-01 18:17:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:04,840 INFO L225 Difference]: With dead ends: 106 [2019-01-01 18:17:04,840 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 18:17:04,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 18:17:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-01 18:17:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 18:17:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-01-01 18:17:04,849 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 43 [2019-01-01 18:17:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:04,849 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-01-01 18:17:04,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-01-01 18:17:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 18:17:04,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:04,857 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:04,858 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1366149559, now seen corresponding path program 1 times [2019-01-01 18:17:04,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:04,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:04,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:17:05,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:05,113 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2019-01-01 18:17:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:05,214 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-01-01 18:17:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:05,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-01 18:17:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:05,217 INFO L225 Difference]: With dead ends: 113 [2019-01-01 18:17:05,218 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 18:17:05,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 18:17:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-01-01 18:17:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 18:17:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-01 18:17:05,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 47 [2019-01-01 18:17:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:05,222 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-01 18:17:05,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-01 18:17:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 18:17:05,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:05,223 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:05,224 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1562663064, now seen corresponding path program 1 times [2019-01-01 18:17:05,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:05,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:05,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:17:05,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:17:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:17:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:17:05,339 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 8 states. [2019-01-01 18:17:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:05,703 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-01-01 18:17:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:17:05,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-01-01 18:17:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:05,706 INFO L225 Difference]: With dead ends: 125 [2019-01-01 18:17:05,706 INFO L226 Difference]: Without dead ends: 125 [2019-01-01 18:17:05,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-01 18:17:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2019-01-01 18:17:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:17:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-01-01 18:17:05,715 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 47 [2019-01-01 18:17:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:05,718 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-01-01 18:17:05,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:17:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-01-01 18:17:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 18:17:05,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:05,719 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:05,719 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:05,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1562663063, now seen corresponding path program 1 times [2019-01-01 18:17:05,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:05,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:05,980 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 18:17:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:06,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:06,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:06,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:06,946 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-01 18:17:06,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:06,962 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-01 18:17:06,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:06,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:06,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-01-01 18:17:07,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,021 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 12 treesize of output 15 [2019-01-01 18:17:07,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,037 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:17:07,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:17:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,062 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 12 treesize of output 15 [2019-01-01 18:17:07,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:07,078 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:17:07,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:07,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:17:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2019-01-01 18:17:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 18:17:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 18:17:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-01-01 18:17:07,403 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 20 states. [2019-01-01 18:17:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:09,458 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2019-01-01 18:17:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 18:17:09,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-01-01 18:17:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:09,461 INFO L225 Difference]: With dead ends: 144 [2019-01-01 18:17:09,461 INFO L226 Difference]: Without dead ends: 144 [2019-01-01 18:17:09,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2019-01-01 18:17:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-01 18:17:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2019-01-01 18:17:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:17:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-01-01 18:17:09,465 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 47 [2019-01-01 18:17:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:09,466 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-01-01 18:17:09,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 18:17:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-01-01 18:17:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 18:17:09,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:09,467 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:09,467 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1939808096, now seen corresponding path program 1 times [2019-01-01 18:17:09,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:09,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:09,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:09,888 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 18:17:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:09,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 18:17:09,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 18:17:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 18:17:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:17:09,917 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 9 states. [2019-01-01 18:17:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:10,323 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-01-01 18:17:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:17:10,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-01-01 18:17:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:10,326 INFO L225 Difference]: With dead ends: 123 [2019-01-01 18:17:10,327 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 18:17:10,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-01 18:17:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 18:17:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2019-01-01 18:17:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 18:17:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-01-01 18:17:10,332 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 48 [2019-01-01 18:17:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:10,332 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-01-01 18:17:10,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 18:17:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-01-01 18:17:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 18:17:10,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:10,337 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:10,338 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1939808095, now seen corresponding path program 1 times [2019-01-01 18:17:10,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:10,734 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 18:17:11,378 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 18:17:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:11,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:11,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:11,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:11,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:11,656 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-01 18:17:11,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,669 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-01 18:17:11,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-01-01 18:17:11,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,774 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 12 treesize of output 15 [2019-01-01 18:17:11,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,792 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:17:11,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:17:11,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,822 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 12 treesize of output 15 [2019-01-01 18:17:11,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:17:11,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:17:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,905 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 12 treesize of output 15 [2019-01-01 18:17:11,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:11,934 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 18:17:11,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:11,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-01-01 18:17:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:11,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:11,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 18 [2019-01-01 18:17:11,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 18:17:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 18:17:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-01-01 18:17:11,996 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 19 states. [2019-01-01 18:17:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:13,867 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-01-01 18:17:13,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:17:13,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-01-01 18:17:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:13,871 INFO L225 Difference]: With dead ends: 142 [2019-01-01 18:17:13,871 INFO L226 Difference]: Without dead ends: 142 [2019-01-01 18:17:13,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-01-01 18:17:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-01 18:17:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 112. [2019-01-01 18:17:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 18:17:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2019-01-01 18:17:13,875 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 48 [2019-01-01 18:17:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:13,875 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2019-01-01 18:17:13,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 18:17:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2019-01-01 18:17:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 18:17:13,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:13,880 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:13,882 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1679907358, now seen corresponding path program 1 times [2019-01-01 18:17:13,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:13,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:14,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:14,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:17:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:14,053 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 5 states. [2019-01-01 18:17:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:14,138 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-01 18:17:14,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:14,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-01 18:17:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:14,143 INFO L225 Difference]: With dead ends: 112 [2019-01-01 18:17:14,143 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 18:17:14,143 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-01 18:17:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 18:17:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-01-01 18:17:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 18:17:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2019-01-01 18:17:14,154 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 53 [2019-01-01 18:17:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:14,154 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2019-01-01 18:17:14,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2019-01-01 18:17:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 18:17:14,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:14,155 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:14,158 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2104525761, now seen corresponding path program 1 times [2019-01-01 18:17:14,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:14,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:14,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:14,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:14,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:17:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:14,379 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 5 states. [2019-01-01 18:17:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:14,570 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-01 18:17:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:14,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-01 18:17:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:14,573 INFO L225 Difference]: With dead ends: 109 [2019-01-01 18:17:14,573 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 18:17:14,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01 18:17:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 18:17:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-01 18:17:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:17:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-01-01 18:17:14,579 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 53 [2019-01-01 18:17:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:14,579 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-01-01 18:17:14,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-01-01 18:17:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 18:17:14,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:14,583 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:14,584 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -815788771, now seen corresponding path program 1 times [2019-01-01 18:17:14,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:14,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:17:14,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:14,834 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 5 states. [2019-01-01 18:17:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:15,422 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2019-01-01 18:17:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:15,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-01 18:17:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:15,425 INFO L225 Difference]: With dead ends: 110 [2019-01-01 18:17:15,425 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 18:17:15,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01 18:17:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 18:17:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-01 18:17:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:17:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-01-01 18:17:15,436 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 54 [2019-01-01 18:17:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:15,437 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-01-01 18:17:15,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-01-01 18:17:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 18:17:15,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:15,438 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:15,438 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash 480352257, now seen corresponding path program 1 times [2019-01-01 18:17:15,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:15,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:15,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:15,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:17:15,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:15,686 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 5 states. [2019-01-01 18:17:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:16,106 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2019-01-01 18:17:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:16,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-01-01 18:17:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:16,108 INFO L225 Difference]: With dead ends: 107 [2019-01-01 18:17:16,109 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 18:17:16,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01 18:17:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 18:17:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-01 18:17:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 18:17:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-01-01 18:17:16,112 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 55 [2019-01-01 18:17:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:16,112 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-01-01 18:17:16,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-01-01 18:17:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 18:17:16,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:16,113 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:16,122 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 5433, now seen corresponding path program 1 times [2019-01-01 18:17:16,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:16,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:16,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:16,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:16,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:16,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 18:17:16,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 18:17:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 18:17:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:17:16,482 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 13 states. [2019-01-01 18:17:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:17,078 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2019-01-01 18:17:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 18:17:17,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-01-01 18:17:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:17,082 INFO L225 Difference]: With dead ends: 142 [2019-01-01 18:17:17,082 INFO L226 Difference]: Without dead ends: 142 [2019-01-01 18:17:17,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-01-01 18:17:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-01 18:17:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2019-01-01 18:17:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 18:17:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-01-01 18:17:17,088 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 62 [2019-01-01 18:17:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:17,089 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-01-01 18:17:17,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 18:17:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-01-01 18:17:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 18:17:17,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:17,092 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:17,092 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 5434, now seen corresponding path program 1 times [2019-01-01 18:17:17,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:17,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:17,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:17,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:17,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:17,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:17,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:17,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:17,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:17:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:17,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 25 [2019-01-01 18:17:17,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 18:17:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 18:17:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-01-01 18:17:17,830 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 26 states. [2019-01-01 18:17:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:19,132 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2019-01-01 18:17:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 18:17:19,136 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2019-01-01 18:17:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:19,137 INFO L225 Difference]: With dead ends: 128 [2019-01-01 18:17:19,137 INFO L226 Difference]: Without dead ends: 128 [2019-01-01 18:17:19,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 18:17:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-01 18:17:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-01-01 18:17:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 18:17:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2019-01-01 18:17:19,147 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 62 [2019-01-01 18:17:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:19,147 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2019-01-01 18:17:19,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 18:17:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2019-01-01 18:17:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 18:17:19,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:19,148 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:19,149 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 556178175, now seen corresponding path program 1 times [2019-01-01 18:17:19,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:19,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:19,479 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-01 18:17:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 18:17:19,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:19,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 18:17:19,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 18:17:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 18:17:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-01-01 18:17:19,686 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 21 states. [2019-01-01 18:17:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:20,712 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-01-01 18:17:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 18:17:20,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2019-01-01 18:17:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:20,716 INFO L225 Difference]: With dead ends: 133 [2019-01-01 18:17:20,717 INFO L226 Difference]: Without dead ends: 133 [2019-01-01 18:17:20,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 18:17:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-01 18:17:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2019-01-01 18:17:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 18:17:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2019-01-01 18:17:20,725 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 65 [2019-01-01 18:17:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:20,725 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2019-01-01 18:17:20,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 18:17:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2019-01-01 18:17:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 18:17:20,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:20,730 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:20,732 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1610402545, now seen corresponding path program 1 times [2019-01-01 18:17:20,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:20,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:21,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:21,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:21,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:21,409 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-01 18:17:21,412 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-01 18:17:21,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 18:17:21,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-01-01 18:17:21,836 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 26 treesize of output 15 [2019-01-01 18:17:21,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,853 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 8 [2019-01-01 18:17:21,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,870 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 0 case distinctions, treesize of input 22 treesize of output 3 [2019-01-01 18:17:21,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:21,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-01-01 18:17:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 18:17:21,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:17:21,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 35 [2019-01-01 18:17:21,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 18:17:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 18:17:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 18:17:21,910 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 36 states. [2019-01-01 18:17:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:23,025 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2019-01-01 18:17:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 18:17:23,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2019-01-01 18:17:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:23,029 INFO L225 Difference]: With dead ends: 154 [2019-01-01 18:17:23,030 INFO L226 Difference]: Without dead ends: 152 [2019-01-01 18:17:23,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=2557, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 18:17:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-01 18:17:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2019-01-01 18:17:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 18:17:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2019-01-01 18:17:23,037 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 71 [2019-01-01 18:17:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:23,039 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2019-01-01 18:17:23,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 18:17:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2019-01-01 18:17:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 18:17:23,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:23,043 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:23,044 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1617129052, now seen corresponding path program 1 times [2019-01-01 18:17:23,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:23,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:23,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:23,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:23,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:23,804 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-01 18:17:23,806 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-01 18:17:23,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:23,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:23,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:23,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 18:17:24,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-01-01 18:17:24,296 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 18:17:24,298 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 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 18:17:24,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:24,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 18:17:24,333 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 18:17:24,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:24,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:24,344 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-01 18:17:24,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-01-01 18:17:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:24,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 36 [2019-01-01 18:17:24,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 18:17:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 18:17:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 18:17:24,391 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 36 states. [2019-01-01 18:17:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:25,512 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-01-01 18:17:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 18:17:25,514 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-01-01 18:17:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:25,516 INFO L225 Difference]: With dead ends: 150 [2019-01-01 18:17:25,516 INFO L226 Difference]: Without dead ends: 149 [2019-01-01 18:17:25,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=2461, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 18:17:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-01 18:17:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2019-01-01 18:17:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 18:17:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-01 18:17:25,522 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 72 [2019-01-01 18:17:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:25,522 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-01 18:17:25,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 18:17:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-01 18:17:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 18:17:25,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:25,523 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:25,523 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:25,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1408355679, now seen corresponding path program 1 times [2019-01-01 18:17:25,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:25,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:25,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:25,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:25,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:25,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:25,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 18:17:25,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:25,974 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 5 states. [2019-01-01 18:17:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:26,142 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-01-01 18:17:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:26,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-01 18:17:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:26,145 INFO L225 Difference]: With dead ends: 128 [2019-01-01 18:17:26,145 INFO L226 Difference]: Without dead ends: 128 [2019-01-01 18:17:26,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-01 18:17:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-01-01 18:17:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 18:17:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-01-01 18:17:26,155 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 73 [2019-01-01 18:17:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:26,155 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-01-01 18:17:26,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-01-01 18:17:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 18:17:26,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:26,156 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:26,160 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2110796279, now seen corresponding path program 1 times [2019-01-01 18:17:26,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:26,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 18:17:26,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:26,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:27,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:27,226 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-01 18:17:27,229 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-01 18:17:27,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:27,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:27,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:27,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 18:17:27,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-01-01 18:17:27,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 18:17:27,782 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 18:17:27,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:27,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:27,822 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-01 18:17:27,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-01-01 18:17:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:27,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:27,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 37 [2019-01-01 18:17:27,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 18:17:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 18:17:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 18:17:27,853 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 38 states. [2019-01-01 18:17:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:29,255 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-01-01 18:17:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 18:17:29,258 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-01 18:17:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:29,259 INFO L225 Difference]: With dead ends: 127 [2019-01-01 18:17:29,259 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 18:17:29,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=200, Invalid=2662, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 18:17:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 18:17:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-01 18:17:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 18:17:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-01-01 18:17:29,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 74 [2019-01-01 18:17:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:29,265 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-01-01 18:17:29,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 18:17:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-01-01 18:17:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 18:17:29,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:29,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:29,266 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:29,267 INFO L82 PathProgramCache]: Analyzing trace with hash -709352647, now seen corresponding path program 1 times [2019-01-01 18:17:29,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:29,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:29,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:29,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:29,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:29,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:29,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:29,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:29,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 18:17:29,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:29,621 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 5 states. [2019-01-01 18:17:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:29,833 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-01 18:17:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:29,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-01 18:17:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:29,836 INFO L225 Difference]: With dead ends: 126 [2019-01-01 18:17:29,836 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 18:17:29,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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-01 18:17:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 18:17:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-01 18:17:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 18:17:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-01-01 18:17:29,840 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 74 [2019-01-01 18:17:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:29,841 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-01-01 18:17:29,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-01-01 18:17:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-01 18:17:29,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:29,841 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:29,842 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1010174814, now seen corresponding path program 1 times [2019-01-01 18:17:29,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:29,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 18:17:30,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:30,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:30,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:30,611 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-01 18:17:30,614 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-01 18:17:30,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:30,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:30,624 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-01 18:17:30,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 18:17:31,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-01-01 18:17:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-01 18:17:31,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:31,739 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-01 18:17:31,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 18:17:31,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:31,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:31,754 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-01-01 18:17:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 18:17:31,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:17:31,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [24] total 38 [2019-01-01 18:17:31,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-01 18:17:31,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-01 18:17:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 18:17:31,787 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 39 states. [2019-01-01 18:17:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:41,877 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-01-01 18:17:41,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 18:17:41,878 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-01 18:17:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:41,880 INFO L225 Difference]: With dead ends: 141 [2019-01-01 18:17:41,880 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 18:17:41,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=195, Invalid=2667, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 18:17:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 18:17:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2019-01-01 18:17:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 18:17:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-01-01 18:17:41,889 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 75 [2019-01-01 18:17:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:41,889 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-01-01 18:17:41,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-01 18:17:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-01-01 18:17:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-01 18:17:41,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:41,890 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:41,899 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash -515095133, now seen corresponding path program 1 times [2019-01-01 18:17:41,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:41,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:17:42,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:42,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:42,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:42,377 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-01 18:17:42,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:42,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:42,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:17:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 18:17:42,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:42,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 18:17:42,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:17:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:17:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:17:42,428 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 6 states. [2019-01-01 18:17:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:42,657 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-01-01 18:17:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 18:17:42,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-01-01 18:17:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:42,660 INFO L225 Difference]: With dead ends: 130 [2019-01-01 18:17:42,660 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 18:17:42,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:17:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 18:17:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-01-01 18:17:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 18:17:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-01-01 18:17:42,664 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 75 [2019-01-01 18:17:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:42,665 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-01-01 18:17:42,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:17:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-01-01 18:17:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 18:17:42,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:42,666 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:17:42,666 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-01 18:17:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1250647765, now seen corresponding path program 1 times [2019-01-01 18:17:42,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:17:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:17:42,769 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 18:17:42,820 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:17:42,824 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:17:42,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:17:42 BoogieIcfgContainer [2019-01-01 18:17:42,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:17:42,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:17:42,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:17:42,873 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:17:42,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:14:29" (3/4) ... [2019-01-01 18:17:42,877 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 18:17:42,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:17:42,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:17:42,952 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 18:17:42,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:17:42,953 INFO L168 Benchmark]: Toolchain (without parser) took 197255.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 951.4 MB in the beginning and 879.7 MB in the end (delta: 71.6 MB). Peak memory consumption was 341.7 MB. Max. memory is 11.5 GB. [2019-01-01 18:17:42,956 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:17:42,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 960.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-01 18:17:42,956 INFO L168 Benchmark]: Boogie Preprocessor took 152.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:17:42,956 INFO L168 Benchmark]: RCFGBuilder took 2293.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.3 MB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2019-01-01 18:17:42,957 INFO L168 Benchmark]: TraceAbstraction took 193757.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 971.3 MB in the beginning and 889.1 MB in the end (delta: 82.2 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. [2019-01-01 18:17:42,957 INFO L168 Benchmark]: Witness Printer took 79.48 ms. Allocated memory is still 1.3 GB. Free memory was 889.1 MB in the beginning and 879.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-01-01 18:17:42,959 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 960.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2293.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.3 MB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193757.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 971.3 MB in the beginning and 889.1 MB in the end (delta: 82.2 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. * Witness Printer took 79.48 ms. Allocated memory is still 1.3 GB. Free memory was 889.1 MB in the beginning and 879.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 21 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 22 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 22 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 21 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: 1486]: 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={-4:0}] [L1514] CALL entry_point() VAL [ldv_global_msg_list={-4:0}] [L1491] CALL, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [\old(size)=20, ldv_global_msg_list={-4:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=20, \result={-2:0}, ldv_global_msg_list={-4:0}, malloc(size)={-2:0}, size=20] [L1491] RET, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [ldv_global_msg_list={-4:0}, ldv_malloc(sizeof(struct ldv_i2c_client))={-2:0}] [L1491] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L1492] COND FALSE !(!c11) VAL [c11={-2:0}, ldv_global_msg_list={-4:0}] [L1494] CALL, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [\old(size)=4, ldv_global_msg_list={-4:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={1:0}, ldv_global_msg_list={-4:0}, malloc(size)={1:0}, size=4] [L1494] RET, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [c11={-2:0}, ldv_global_msg_list={-4:0}, ldv_malloc(sizeof(struct ldv_m88ts2022_config))={1:0}] [L1493-L1494] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L1495] COND FALSE !(!cfg) VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-4:0}] [L1496] c11->dev.platform_data = cfg VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-4:0}] [L1498] CALL, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [\old(size)=4, ldv_global_msg_list={-4:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={2:0}, ldv_global_msg_list={-4:0}, malloc(size)={2:0}, size=4] [L1498] RET, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-4:0}, ldv_malloc(sizeof(struct ldv_dvb_frontend))={2:0}] [L1497-L1498] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L1499] COND FALSE !(!fe) VAL [c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-4:0}] [L1500] cfg->fe = fe VAL [c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-4:0}] [L1501] CALL alloc_2_11(c11) VAL [client={-2:0}, ldv_global_msg_list={-4:0}] [L1470] EXPR client->dev.platform_data VAL [client={-2:0}, client={-2:0}, client->dev.platform_data={1:0}, ldv_global_msg_list={-4:0}] [L1470] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L1471] EXPR cfg->fe VAL [cfg={1:0}, cfg->fe={2:0}, client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}] [L1471] struct ldv_dvb_frontend *fe = cfg->fe; [L1472] CALL, EXPR ldv_malloc(sizeof(struct Data11)) VAL [\old(size)=12, ldv_global_msg_list={-4:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={-1:0}, ldv_global_msg_list={-4:0}, malloc(size)={-1:0}, size=12] [L1472] RET, EXPR ldv_malloc(sizeof(struct Data11)) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, ldv_malloc(sizeof(struct Data11))={-1:0}] [L1472] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L1473] COND FALSE !(!priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1474] fe->tuner_priv = priv VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1475] CALL ldv_i2c_set_clientdata(client, priv) VAL [data={-1:0}, dev={-2:0}, ldv_global_msg_list={-4:0}] [L1462] CALL ldv_dev_set_drvdata(&dev->dev, data) VAL [data={-1:0}, dev={-2:0}, ldv_global_msg_list={-4:0}] [L1198] dev->driver_data = data VAL [data={-1:0}, data={-1:0}, dev={-2:0}, dev={-2:0}, ldv_global_msg_list={-4:0}] [L1462] RET ldv_dev_set_drvdata(&dev->dev, data) VAL [data={-1:0}, data={-1:0}, dev={-2:0}, dev={-2:0}, ldv_global_msg_list={-4:0}] [L1475] RET ldv_i2c_set_clientdata(client, priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1476] free(priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1476] free(priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1476] free(priv) [L1477] return 0; VAL [\result=0, cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1501] RET alloc_2_11(c11) VAL [alloc_2_11(c11)=0, c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-4:0}] [L1502] CALL free_11(c11) VAL [client={-2:0}, ldv_global_msg_list={-4:0}] [L1484] CALL, EXPR ldv_i2c_get_clientdata(client) VAL [dev={-2:0}, ldv_global_msg_list={-4:0}] [L1457] CALL, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-2:0}, ldv_global_msg_list={-4:0}] [L1193] EXPR dev->driver_data VAL [dev={-2:0}, dev={-2:0}, dev->driver_data={-1:0}, ldv_global_msg_list={-4:0}] [L1193] return dev->driver_data; [L1457] RET, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-2:0}, dev={-2:0}, ldv_dev_get_drvdata(&dev->dev)={-1:0}, ldv_global_msg_list={-4:0}] [L1457] return ldv_dev_get_drvdata(&dev->dev); [L1484] RET, EXPR ldv_i2c_get_clientdata(client) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}, ldv_i2c_get_clientdata(client)={-1:0}] [L1484] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L1485] COND TRUE \read(*priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1486] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1486] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] [L1486] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-4:0}, priv={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 396 locations, 96 error locations. UNSAFE Result, 193.6s OverallTime, 41 OverallIterations, 4 TraceHistogramMax, 139.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3995 SDtfs, 3271 SDslu, 23008 SDs, 0 SdLazy, 21982 SolverSat, 1073 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 72.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1823 GetRequests, 1031 SyntacticMatches, 80 SemanticMatches, 712 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3891 ImplicationChecksByTransitivity, 108.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred 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.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 975 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 49.8s InterpolantComputationTime, 3004 NumberOfCodeBlocks, 3004 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2862 ConstructedInterpolants, 101 QuantifiedInterpolants, 709877 SizeOfPredicates, 224 NumberOfNonLiveVariables, 6544 ConjunctsInSsa, 921 ConjunctsInUnsatCore, 66 InterpolantComputations, 20 PerfectInterpolantSequences, 857/1100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...