./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.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_test13_true-valid-memsafety.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 976e1955e162f3b4e872a15f7e9a64e265f0afc5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 18:29:07,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 18:29:07,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 18:29:07,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 18:29:07,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 18:29:07,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 18:29:07,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 18:29:07,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 18:29:07,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 18:29:07,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 18:29:07,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 18:29:07,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 18:29:07,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 18:29:07,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 18:29:07,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 18:29:07,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 18:29:07,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 18:29:07,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 18:29:07,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 18:29:07,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 18:29:07,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 18:29:07,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 18:29:07,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 18:29:07,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 18:29:07,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 18:29:07,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 18:29:07,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 18:29:07,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 18:29:07,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 18:29:07,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 18:29:07,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 18:29:07,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 18:29:07,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 18:29:07,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 18:29:07,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 18:29:07,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 18:29:07,939 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:29:07,962 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 18:29:07,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 18:29:07,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 18:29:07,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 18:29:07,964 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 18:29:07,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 18:29:07,965 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 18:29:07,965 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 18:29:07,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 18:29:07,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 18:29:07,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 18:29:07,966 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 18:29:07,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 18:29:07,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 18:29:07,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 18:29:07,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 18:29:07,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:29:07,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 18:29:07,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 18:29:07,968 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 18:29:07,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 18:29:07,968 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 -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2019-01-01 18:29:08,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 18:29:08,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 18:29:08,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 18:29:08,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 18:29:08,057 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 18:29:08,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-01 18:29:08,121 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d7e9e2/14bccc5af4864105b9e6911b88df2fd3/FLAGbe5d0044b [2019-01-01 18:29:08,638 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 18:29:08,638 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-01 18:29:08,659 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d7e9e2/14bccc5af4864105b9e6911b88df2fd3/FLAGbe5d0044b [2019-01-01 18:29:08,929 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d7e9e2/14bccc5af4864105b9e6911b88df2fd3 [2019-01-01 18:29:08,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 18:29:08,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 18:29:08,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 18:29:08,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 18:29:08,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 18:29:08,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:29:08" (1/1) ... [2019-01-01 18:29:08,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ff0cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:08, skipping insertion in model container [2019-01-01 18:29:08,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:29:08" (1/1) ... [2019-01-01 18:29:08,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 18:29:09,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 18:29:09,531 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:29:09,566 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 18:29:09,753 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:29:09,843 INFO L195 MainTranslator]: Completed translation [2019-01-01 18:29:09,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09 WrapperNode [2019-01-01 18:29:09,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 18:29:09,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 18:29:09,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 18:29:09,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 18:29:09,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (1/1) ... [2019-01-01 18:29:09,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 18:29:09,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 18:29:09,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 18:29:09,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 18:29:09,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (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:29:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-01 18:29:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-01 18:29:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-01 18:29:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:29:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-01 18:29:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-01 18:29:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-01 18:29:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-01 18:29:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-01 18:29:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-01 18:29:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-01 18:29:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-01 18:29:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-01 18:29:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-01 18:29:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-01 18:29:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-01 18:29:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 18:29:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-01 18:29:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 18:29:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 18:29:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 18:29:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 18:29:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 18:29:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 18:29:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 18:29:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 18:29:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 18:29:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 18:29:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 18:29:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 18:29:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 18:29:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 18:29:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 18:29:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 18:29:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 18:29:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-01 18:29:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 18:29:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-01 18:29:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-01 18:29:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-01 18:29:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-01 18:29:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-01 18:29:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-01 18:29:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-01-01 18:29:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-01 18:29:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-01 18:29:10,796 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:29:11,625 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:29:12,243 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 18:29:12,244 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 18:29:12,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:29:12 BoogieIcfgContainer [2019-01-01 18:29:12,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 18:29:12,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 18:29:12,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 18:29:12,249 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 18:29:12,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 06:29:08" (1/3) ... [2019-01-01 18:29:12,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3edffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:29:12, skipping insertion in model container [2019-01-01 18:29:12,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:29:09" (2/3) ... [2019-01-01 18:29:12,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3edffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:29:12, skipping insertion in model container [2019-01-01 18:29:12,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:29:12" (3/3) ... [2019-01-01 18:29:12,253 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2019-01-01 18:29:12,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 18:29:12,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-01-01 18:29:12,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-01-01 18:29:12,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 18:29:12,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 18:29:12,323 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 18:29:12,323 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 18:29:12,323 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 18:29:12,323 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 18:29:12,323 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 18:29:12,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 18:29:12,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 18:29:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-01 18:29:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 18:29:12,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:12,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:12,375 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1566870466, now seen corresponding path program 1 times [2019-01-01 18:29:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:12,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:12,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:13,215 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:29:13,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:13,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:29:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:29:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:29:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:29:13,243 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 8 states. [2019-01-01 18:29:13,633 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 18:29:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:14,879 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-01-01 18:29:14,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:29:14,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 18:29:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:14,897 INFO L225 Difference]: With dead ends: 157 [2019-01-01 18:29:14,897 INFO L226 Difference]: Without dead ends: 150 [2019-01-01 18:29:14,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:29:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-01 18:29:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2019-01-01 18:29:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:29:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-01-01 18:29:14,972 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-01-01 18:29:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:14,973 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-01-01 18:29:14,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:29:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-01-01 18:29:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 18:29:14,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:14,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:14,976 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1566870467, now seen corresponding path program 1 times [2019-01-01 18:29:14,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:14,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:15,317 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:29:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:15,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:29:15,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:29:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:29:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:29:15,320 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2019-01-01 18:29:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:16,170 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-01 18:29:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:29:16,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 18:29:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:16,177 INFO L225 Difference]: With dead ends: 112 [2019-01-01 18:29:16,178 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 18:29:16,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:29:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 18:29:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-01-01 18:29:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 18:29:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-01 18:29:16,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-01-01 18:29:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:16,201 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-01 18:29:16,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:29:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-01 18:29:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 18:29:16,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:16,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:16,203 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:16,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:16,206 INFO L82 PathProgramCache]: Analyzing trace with hash 933847132, now seen corresponding path program 1 times [2019-01-01 18:29:16,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:16,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:16,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:16,386 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:29:16,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:29:16,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:29:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:29:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:29:16,388 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 8 states. [2019-01-01 18:29:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:16,883 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-01-01 18:29:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:29:16,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-01 18:29:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:16,888 INFO L225 Difference]: With dead ends: 150 [2019-01-01 18:29:16,889 INFO L226 Difference]: Without dead ends: 150 [2019-01-01 18:29:16,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:29:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-01 18:29:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2019-01-01 18:29:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 18:29:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-01-01 18:29:16,905 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-01-01 18:29:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:16,905 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-01-01 18:29:16,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:29:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-01-01 18:29:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 18:29:16,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:16,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:16,908 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash 933847133, now seen corresponding path program 1 times [2019-01-01 18:29:16,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:16,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:16,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:17,314 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:29:17,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:17,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:29:17,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:29:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:29:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:29:17,316 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 11 states. [2019-01-01 18:29:17,849 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 18:29:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:18,848 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2019-01-01 18:29:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 18:29:18,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-01 18:29:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:18,852 INFO L225 Difference]: With dead ends: 148 [2019-01-01 18:29:18,852 INFO L226 Difference]: Without dead ends: 148 [2019-01-01 18:29:18,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-01-01 18:29:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-01 18:29:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 105. [2019-01-01 18:29:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 18:29:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-01-01 18:29:18,864 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-01-01 18:29:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-01-01 18:29:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:29:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-01-01 18:29:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:18,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:18,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:18,868 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1115509935, now seen corresponding path program 1 times [2019-01-01 18:29:18,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:18,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:19,015 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:29:19,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:19,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 18:29:19,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 18:29:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 18:29:19,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:29:19,017 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2019-01-01 18:29:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:19,324 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-01 18:29:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:29:19,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-01 18:29:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:19,327 INFO L225 Difference]: With dead ends: 121 [2019-01-01 18:29:19,327 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 18:29:19,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:29:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 18:29:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-01 18:29:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 18:29:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-01 18:29:19,338 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-01-01 18:29:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:19,338 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-01 18:29:19,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 18:29:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-01 18:29:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:19,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:19,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:19,340 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1115509934, now seen corresponding path program 1 times [2019-01-01 18:29:19,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:19,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:19,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:19,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:19,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:19,557 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:29:19,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:19,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 18:29:19,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:29:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:29:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:29:19,559 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 10 states. [2019-01-01 18:29:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:20,036 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-01 18:29:20,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:29:20,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-01 18:29:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:20,040 INFO L225 Difference]: With dead ends: 119 [2019-01-01 18:29:20,040 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 18:29:20,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:29:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 18:29:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-01-01 18:29:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 18:29:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-01-01 18:29:20,050 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-01-01 18:29:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:20,050 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-01-01 18:29:20,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:29:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-01-01 18:29:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:20,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:20,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:20,055 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash -986427216, now seen corresponding path program 1 times [2019-01-01 18:29:20,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:20,179 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:29:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:20,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:29:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:29:20,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:29:20,181 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-01-01 18:29:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:20,206 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-01 18:29:20,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:29:20,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 18:29:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:20,208 INFO L225 Difference]: With dead ends: 102 [2019-01-01 18:29:20,209 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 18:29:20,209 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:29:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 18:29:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-01 18:29:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-01 18:29:20,217 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-01-01 18:29:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:20,217 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-01 18:29:20,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:29:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-01 18:29:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:20,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:20,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:20,221 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash -16522430, now seen corresponding path program 1 times [2019-01-01 18:29:20,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:20,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:20,301 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:29:20,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:20,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:20,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:29:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:29:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:29:20,304 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-01-01 18:29:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:20,334 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-01-01 18:29:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:29:20,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 18:29:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:20,337 INFO L225 Difference]: With dead ends: 100 [2019-01-01 18:29:20,337 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 18:29:20,338 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:29:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 18:29:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 18:29:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-01 18:29:20,345 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-01-01 18:29:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:20,345 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-01 18:29:20,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:29:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-01 18:29:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:20,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:20,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:20,349 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash 112560289, now seen corresponding path program 1 times [2019-01-01 18:29:20,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:20,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:20,607 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:29:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:20,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:20,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:29:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:29:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:20,609 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2019-01-01 18:29:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:20,902 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-01-01 18:29:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:29:20,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-01 18:29:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:20,905 INFO L225 Difference]: With dead ends: 137 [2019-01-01 18:29:20,906 INFO L226 Difference]: Without dead ends: 135 [2019-01-01 18:29:20,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:29:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-01 18:29:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-01-01 18:29:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 18:29:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-01-01 18:29:20,914 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-01-01 18:29:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:20,914 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-01-01 18:29:20,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:29:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-01-01 18:29:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:29:20,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:20,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:20,918 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash 112560290, now seen corresponding path program 1 times [2019-01-01 18:29:20,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:21,113 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 18:29:21,172 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:29:21,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:21,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:29:21,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 18:29:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 18:29:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 18:29:21,174 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 7 states. [2019-01-01 18:29:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:22,531 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2019-01-01 18:29:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:29:22,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-01 18:29:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:22,533 INFO L225 Difference]: With dead ends: 134 [2019-01-01 18:29:22,533 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 18:29:22,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:29:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 18:29:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2019-01-01 18:29:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 18:29:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-01-01 18:29:22,541 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2019-01-01 18:29:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:22,541 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-01-01 18:29:22,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 18:29:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-01-01 18:29:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 18:29:22,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:22,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:22,548 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1736778004, now seen corresponding path program 1 times [2019-01-01 18:29:22,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:22,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:22,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:22,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:22,817 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:29:22,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:22,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:29:22,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:29:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:29:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:29:22,819 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2019-01-01 18:29:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:23,257 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-01 18:29:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:29:23,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-01 18:29:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:23,260 INFO L225 Difference]: With dead ends: 114 [2019-01-01 18:29:23,260 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 18:29:23,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 18:29:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-01 18:29:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:29:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-01 18:29:23,265 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 23 [2019-01-01 18:29:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-01 18:29:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:29:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-01 18:29:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 18:29:23,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:23,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:23,270 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1736778005, now seen corresponding path program 1 times [2019-01-01 18:29:23,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:23,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:23,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:23,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:23,564 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:29:23,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:23,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 18:29:23,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:29:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:29:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:29:23,566 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 10 states. [2019-01-01 18:29:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:23,987 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-01-01 18:29:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:29:23,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-01 18:29:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:23,991 INFO L225 Difference]: With dead ends: 129 [2019-01-01 18:29:23,991 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 18:29:23,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-01 18:29:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 18:29:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-01-01 18:29:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 18:29:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-01-01 18:29:23,998 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 23 [2019-01-01 18:29:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:23,998 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-01-01 18:29:23,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:29:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-01-01 18:29:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:29:23,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:23,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:24,000 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash 439072057, now seen corresponding path program 1 times [2019-01-01 18:29:24,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:24,075 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:29:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:24,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:29:24,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:29:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:29:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:29:24,077 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 5 states. [2019-01-01 18:29:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:24,227 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-01-01 18:29:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 18:29:24,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-01 18:29:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:24,230 INFO L225 Difference]: With dead ends: 125 [2019-01-01 18:29:24,230 INFO L226 Difference]: Without dead ends: 125 [2019-01-01 18:29:24,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-01 18:29:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2019-01-01 18:29:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 18:29:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-01-01 18:29:24,241 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 26 [2019-01-01 18:29:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:24,242 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-01-01 18:29:24,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:29:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-01-01 18:29:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:29:24,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:24,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:24,246 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:24,250 INFO L82 PathProgramCache]: Analyzing trace with hash 439072058, now seen corresponding path program 1 times [2019-01-01 18:29:24,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:24,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:24,433 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:29:24,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:24,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:29:24,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 18:29:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 18:29:24,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 18:29:24,434 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 7 states. [2019-01-01 18:29:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:24,919 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-01-01 18:29:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:29:24,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-01 18:29:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:24,922 INFO L225 Difference]: With dead ends: 123 [2019-01-01 18:29:24,922 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 18:29:24,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:29:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 18:29:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-01-01 18:29:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 18:29:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-01 18:29:24,929 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-01-01 18:29:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:24,929 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-01 18:29:24,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 18:29:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-01 18:29:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 18:29:24,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:24,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:24,931 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 917142671, now seen corresponding path program 1 times [2019-01-01 18:29:24,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:25,034 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:29:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:29:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:29:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:25,036 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2019-01-01 18:29:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:25,292 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-01-01 18:29:25,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:29:25,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-01 18:29:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:25,295 INFO L225 Difference]: With dead ends: 143 [2019-01-01 18:29:25,295 INFO L226 Difference]: Without dead ends: 143 [2019-01-01 18:29:25,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:29:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-01 18:29:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-01-01 18:29:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 18:29:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-01-01 18:29:25,303 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-01-01 18:29:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:25,304 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-01-01 18:29:25,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:29:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-01-01 18:29:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 18:29:25,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:25,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:25,305 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 917142672, now seen corresponding path program 1 times [2019-01-01 18:29:25,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:25,438 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:29:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:25,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:29:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:29:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:25,439 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 6 states. [2019-01-01 18:29:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:25,781 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-01-01 18:29:25,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:29:25,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-01 18:29:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:25,784 INFO L225 Difference]: With dead ends: 129 [2019-01-01 18:29:25,784 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 18:29:25,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:29:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 18:29:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-01 18:29:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 18:29:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-01 18:29:25,791 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2019-01-01 18:29:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:25,793 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-01 18:29:25,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:29:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-01 18:29:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:29:25,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:25,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:25,797 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash 179612576, now seen corresponding path program 1 times [2019-01-01 18:29:25,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:25,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:25,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:25,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:26,096 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:29:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 18:29:26,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 18:29:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 18:29:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:29:26,098 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-01-01 18:29:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:26,639 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-01-01 18:29:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 18:29:26,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-01-01 18:29:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:26,642 INFO L225 Difference]: With dead ends: 121 [2019-01-01 18:29:26,643 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 18:29:26,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-01-01 18:29:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 18:29:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2019-01-01 18:29:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:29:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-01 18:29:26,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-01-01 18:29:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:26,650 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-01 18:29:26,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 18:29:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-01 18:29:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:29:26,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:26,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:26,655 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 179612577, now seen corresponding path program 1 times [2019-01-01 18:29:26,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:26,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:27,060 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:29:27,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:27,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 18:29:27,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 18:29:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 18:29:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:29:27,062 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 13 states. [2019-01-01 18:29:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:27,733 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-01-01 18:29:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:29:27,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-01-01 18:29:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:27,736 INFO L225 Difference]: With dead ends: 116 [2019-01-01 18:29:27,736 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 18:29:27,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-01-01 18:29:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 18:29:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2019-01-01 18:29:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:29:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-01 18:29:27,742 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 35 [2019-01-01 18:29:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:27,744 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-01 18:29:27,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 18:29:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-01 18:29:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 18:29:27,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:27,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:27,748 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1970641307, now seen corresponding path program 1 times [2019-01-01 18:29:27,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:27,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:27,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:29:28,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:28,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 18:29:28,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 18:29:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 18:29:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-01 18:29:28,251 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 16 states. [2019-01-01 18:29:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:29,196 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-01-01 18:29:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 18:29:29,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-01 18:29:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:29,199 INFO L225 Difference]: With dead ends: 114 [2019-01-01 18:29:29,199 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 18:29:29,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-01-01 18:29:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 18:29:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-01-01 18:29:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:29:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-01 18:29:29,208 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2019-01-01 18:29:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:29,209 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-01 18:29:29,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 18:29:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-01 18:29:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 18:29:29,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:29,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:29,214 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -418591567, now seen corresponding path program 1 times [2019-01-01 18:29:29,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:29,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:29,503 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:29:29,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:29,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-01 18:29:29,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:29:29,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:29:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:29:29,505 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 17 states. [2019-01-01 18:29:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:30,550 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-01 18:29:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 18:29:30,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-01-01 18:29:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:30,552 INFO L225 Difference]: With dead ends: 106 [2019-01-01 18:29:30,552 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 18:29:30,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 18:29:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 18:29:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-01-01 18:29:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-01-01 18:29:30,557 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 42 [2019-01-01 18:29:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:30,557 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-01-01 18:29:30,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:29:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-01-01 18:29:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 18:29:30,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:30,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:30,558 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash 671545618, now seen corresponding path program 1 times [2019-01-01 18:29:30,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:30,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:30,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:31,719 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:29:31,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:31,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-01 18:29:31,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 18:29:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 18:29:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-01-01 18:29:31,720 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 24 states. [2019-01-01 18:29:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:33,403 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-01-01 18:29:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 18:29:33,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-01 18:29:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:33,406 INFO L225 Difference]: With dead ends: 103 [2019-01-01 18:29:33,406 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 18:29:33,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 18:29:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 18:29:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-01-01 18:29:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-01 18:29:33,411 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 44 [2019-01-01 18:29:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:33,411 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-01 18:29:33,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 18:29:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-01 18:29:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 18:29:33,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:33,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:33,412 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash 671545619, now seen corresponding path program 1 times [2019-01-01 18:29:33,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:34,575 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:29:34,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:34,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-01 18:29:34,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 18:29:34,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 18:29:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-01-01 18:29:34,576 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 26 states. [2019-01-01 18:29:35,462 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-01-01 18:29:35,635 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-01-01 18:29:35,979 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-01-01 18:29:36,441 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-01 18:29:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:37,563 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-01 18:29:37,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 18:29:37,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2019-01-01 18:29:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:37,567 INFO L225 Difference]: With dead ends: 102 [2019-01-01 18:29:37,567 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 18:29:37,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=258, Invalid=2094, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 18:29:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 18:29:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-01 18:29:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-01 18:29:37,571 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 44 [2019-01-01 18:29:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:37,571 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-01 18:29:37,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 18:29:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-01 18:29:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 18:29:37,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:37,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:37,576 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash -656922246, now seen corresponding path program 1 times [2019-01-01 18:29:37,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:38,358 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:29:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:38,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-01 18:29:38,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 18:29:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 18:29:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-01-01 18:29:38,359 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 22 states. [2019-01-01 18:29:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:39,858 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-01-01 18:29:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 18:29:39,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-01 18:29:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:39,862 INFO L225 Difference]: With dead ends: 101 [2019-01-01 18:29:39,862 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 18:29:39,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 18:29:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 18:29:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-01 18:29:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-01-01 18:29:39,868 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 45 [2019-01-01 18:29:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:39,868 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-01-01 18:29:39,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 18:29:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-01-01 18:29:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 18:29:39,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:39,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:39,875 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash -656922245, now seen corresponding path program 1 times [2019-01-01 18:29:39,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:39,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:40,543 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-01-01 18:29:40,698 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-01-01 18:29:41,484 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:29:41,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:41,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-01 18:29:41,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 18:29:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 18:29:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-01-01 18:29:41,486 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 24 states. [2019-01-01 18:29:42,760 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-01 18:29:43,602 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-01-01 18:29:43,815 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-01-01 18:29:44,192 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-01-01 18:29:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:45,263 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-01-01 18:29:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 18:29:45,264 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-01-01 18:29:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:45,265 INFO L225 Difference]: With dead ends: 100 [2019-01-01 18:29:45,265 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 18:29:45,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 18:29:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 18:29:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 18:29:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-01-01 18:29:45,270 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 45 [2019-01-01 18:29:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:45,273 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-01-01 18:29:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 18:29:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-01-01 18:29:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 18:29:45,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:45,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:45,277 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1976398196, now seen corresponding path program 1 times [2019-01-01 18:29:45,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:45,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:29:46,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:46,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 18:29:46,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:29:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:29:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:29:46,068 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 17 states. [2019-01-01 18:29:46,607 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 18:29:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:47,523 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-01-01 18:29:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 18:29:47,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2019-01-01 18:29:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:47,526 INFO L225 Difference]: With dead ends: 100 [2019-01-01 18:29:47,526 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 18:29:47,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-01-01 18:29:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 18:29:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 18:29:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-01 18:29:47,531 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 51 [2019-01-01 18:29:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:47,531 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-01 18:29:47,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:29:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-01 18:29:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 18:29:47,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:47,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,533 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1138801544, now seen corresponding path program 1 times [2019-01-01 18:29:47,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:47,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:48,429 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:29:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:48,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 18:29:48,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 18:29:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 18:29:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:29:48,431 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 12 states. [2019-01-01 18:29:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:48,752 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-01 18:29:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 18:29:48,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-01-01 18:29:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:48,754 INFO L225 Difference]: With dead ends: 100 [2019-01-01 18:29:48,755 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 18:29:48,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:29:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 18:29:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 18:29:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-01 18:29:48,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 52 [2019-01-01 18:29:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:48,763 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-01 18:29:48,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 18:29:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-01 18:29:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 18:29:48,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:48,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:48,767 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash -89738863, now seen corresponding path program 1 times [2019-01-01 18:29:48,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:49,689 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:29:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-01-01 18:29:49,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 18:29:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 18:29:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2019-01-01 18:29:49,691 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 30 states. [2019-01-01 18:29:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:52,516 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-01 18:29:52,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 18:29:52,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-01-01 18:29:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:52,519 INFO L225 Difference]: With dead ends: 103 [2019-01-01 18:29:52,519 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 18:29:52,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=237, Invalid=2415, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 18:29:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 18:29:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-01 18:29:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 18:29:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-01-01 18:29:52,524 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 55 [2019-01-01 18:29:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:52,525 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-01-01 18:29:52,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 18:29:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-01-01 18:29:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 18:29:52,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:52,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,529 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash -89738862, now seen corresponding path program 1 times [2019-01-01 18:29:52,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:53,742 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:29:53,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:53,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 18:29:53,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 18:29:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 18:29:53,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2019-01-01 18:29:53,744 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 28 states. [2019-01-01 18:29:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:55,728 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-01 18:29:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 18:29:55,730 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-01-01 18:29:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:55,732 INFO L225 Difference]: With dead ends: 103 [2019-01-01 18:29:55,732 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 18:29:55,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 18:29:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 18:29:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-01 18:29:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 18:29:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-01 18:29:55,736 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 55 [2019-01-01 18:29:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-01 18:29:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 18:29:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-01 18:29:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 18:29:55,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:55,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:55,741 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -781807650, now seen corresponding path program 1 times [2019-01-01 18:29:55,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:55,904 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:29:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:29:55,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:29:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:29:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:29:55,905 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 6 states. [2019-01-01 18:29:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:56,072 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-01 18:29:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:29:56,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-01 18:29:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:56,075 INFO L225 Difference]: With dead ends: 100 [2019-01-01 18:29:56,075 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 18:29:56,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:29:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 18:29:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 18:29:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 18:29:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-01 18:29:56,081 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 60 [2019-01-01 18:29:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:56,081 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-01 18:29:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:29:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-01 18:29:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 18:29:56,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:56,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:29:56,082 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -781807649, now seen corresponding path program 1 times [2019-01-01 18:29:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:29:56,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:29:56,514 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:29:56,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:56,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:29:57,225 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 27 [2019-01-01 18:29:57,241 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 27 treesize of output 19 [2019-01-01 18:29:57,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:29:57,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:29:57,359 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 23 treesize of output 19 [2019-01-01 18:29:57,375 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 19 treesize of output 7 [2019-01-01 18:29:57,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:29:57,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:29:57,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:29:57,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2019-01-01 18:29:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:29:57,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:29:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2019-01-01 18:29:57,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 18:29:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 18:29:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-01 18:29:57,624 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 20 states. [2019-01-01 18:29:58,951 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-01 18:29:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:29:59,441 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-01-01 18:29:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:29:59,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-01-01 18:29:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:29:59,444 INFO L225 Difference]: With dead ends: 118 [2019-01-01 18:29:59,445 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 18:29:59,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-01-01 18:29:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 18:29:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-01 18:29:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 18:29:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-01-01 18:29:59,450 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 60 [2019-01-01 18:29:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:29:59,451 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-01-01 18:29:59,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 18:29:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-01-01 18:29:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 18:29:59,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:29:59,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:59,452 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:29:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:29:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash 177816052, now seen corresponding path program 1 times [2019-01-01 18:29:59,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:29:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:29:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:59,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:29:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:29:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:29:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:29:59,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:29:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:29:59,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 18:29:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 18:29:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 18:29:59,984 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 7 states. [2019-01-01 18:30:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:30:00,404 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-01-01 18:30:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:30:00,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-01-01 18:30:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:30:00,407 INFO L225 Difference]: With dead ends: 109 [2019-01-01 18:30:00,407 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 18:30:00,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:30:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 18:30:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-01 18:30:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:30:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-01-01 18:30:00,411 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 62 [2019-01-01 18:30:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:30:00,411 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-01-01 18:30:00,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 18:30:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-01-01 18:30:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 18:30:00,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:30:00,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,413 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:30:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:30:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 177816053, now seen corresponding path program 1 times [2019-01-01 18:30:00,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:30:00,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:30:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:00,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:00,803 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 18:30:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 18:30:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:30:00,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-01 18:30:00,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 18:30:00,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 18:30:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:30:00,979 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 14 states. [2019-01-01 18:30:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:30:01,533 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-01 18:30:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 18:30:01,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-01 18:30:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:30:01,536 INFO L225 Difference]: With dead ends: 108 [2019-01-01 18:30:01,536 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 18:30:01,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-01-01 18:30:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 18:30:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-01 18:30:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:30:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-01 18:30:01,540 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 62 [2019-01-01 18:30:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:30:01,540 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-01 18:30:01,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 18:30:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-01 18:30:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 18:30:01,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:30:01,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:30:01,541 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:30:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:30:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1706349226, now seen corresponding path program 1 times [2019-01-01 18:30:01,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:30:01,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:30:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:30:03,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:30:03,167 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:30:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:03,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:30:03,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 18:30:03,290 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:30:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,347 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:30:03,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:24 [2019-01-01 18:30:03,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 18:30:03,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,446 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 7 treesize of output 5 [2019-01-01 18:30:03,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 18:30:03,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:03,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:18 [2019-01-01 18:30:03,683 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 18:30:05,311 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 18:30:05,906 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 18:30:06,452 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 18:30:06,459 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:30:06,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:06,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:06,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2019-01-01 18:30:07,081 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 11 treesize of output 8 [2019-01-01 18:30:07,084 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:30:07,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-01-01 18:30:07,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-01 18:30:07,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:07,222 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 16 treesize of output 23 [2019-01-01 18:30:07,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-01 18:30:07,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2019-01-01 18:30:07,453 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 29 treesize of output 28 [2019-01-01 18:30:07,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:07,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:07,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2019-01-01 18:30:07,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 18:30:07,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:30:07,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:30:07,565 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:68 [2019-01-01 18:30:09,480 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-01 18:30:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:09,527 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:30:09,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,549 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 23 treesize of output 19 [2019-01-01 18:30:09,555 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 19 treesize of output 11 [2019-01-01 18:30:09,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:39 [2019-01-01 18:30:09,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 31 [2019-01-01 18:30:09,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2019-01-01 18:30:09,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 18:30:09,935 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 22 treesize of output 17 [2019-01-01 18:30:09,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,937 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 8 [2019-01-01 18:30:09,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:10,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 39 [2019-01-01 18:30:10,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-01-01 18:30:10,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:30:10,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:30:10,258 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:55, output treesize:89 [2019-01-01 18:30:11,397 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 18 treesize of output 9 [2019-01-01 18:30:11,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:11,423 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 18:30:11,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:11,446 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:30:11,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:5 [2019-01-01 18:30:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:30:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:30:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2019-01-01 18:30:11,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-01 18:30:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-01 18:30:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3471, Unknown=0, NotChecked=0, Total=3660 [2019-01-01 18:30:11,550 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 61 states. [2019-01-01 18:30:14,296 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-01 18:30:16,107 WARN L181 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-01 18:30:17,399 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-01 18:30:18,741 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-01 18:30:18,979 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-01 18:30:19,719 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 18:30:20,497 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-01-01 18:30:21,654 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 18:30:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:30:22,745 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2019-01-01 18:30:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 18:30:22,748 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64 [2019-01-01 18:30:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:30:22,749 INFO L225 Difference]: With dead ends: 70 [2019-01-01 18:30:22,749 INFO L226 Difference]: Without dead ends: 70 [2019-01-01 18:30:22,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=682, Invalid=8248, Unknown=0, NotChecked=0, Total=8930 [2019-01-01 18:30:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-01 18:30:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-01 18:30:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 18:30:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2019-01-01 18:30:22,754 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 64 [2019-01-01 18:30:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:30:22,755 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2019-01-01 18:30:22,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-01 18:30:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2019-01-01 18:30:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 18:30:22,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:30:22,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,756 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:30:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:30:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1217330354, now seen corresponding path program 1 times [2019-01-01 18:30:22,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:30:22,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:30:22,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:22,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:22,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 18:30:23,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:30:23,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 18:30:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 18:30:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 18:30:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-01-01 18:30:23,025 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand 15 states. [2019-01-01 18:30:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:30:24,076 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2019-01-01 18:30:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 18:30:24,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-01-01 18:30:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:30:24,078 INFO L225 Difference]: With dead ends: 69 [2019-01-01 18:30:24,079 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 18:30:24,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-01-01 18:30:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 18:30:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-01 18:30:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 18:30:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2019-01-01 18:30:24,082 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 63 [2019-01-01 18:30:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:30:24,082 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2019-01-01 18:30:24,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 18:30:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2019-01-01 18:30:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 18:30:24,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:30:24,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,083 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_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_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_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_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, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:30:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:30:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 376565514, now seen corresponding path program 1 times [2019-01-01 18:30:24,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:30:24,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:30:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:30:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:30:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:30:24,425 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:30:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:30:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:30:24,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:30:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:30:24,835 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 5 [2019-01-01 18:30:24,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:24,839 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:30:24,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-01 18:30:24,996 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 11 treesize of output 8 [2019-01-01 18:30:24,998 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:30:24,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:25,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:25,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:30:25,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-01-01 18:30:25,144 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 9 treesize of output 1 [2019-01-01 18:30:25,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:25,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:30:25,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2019-01-01 18:30:25,288 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 20 treesize of output 16 [2019-01-01 18:30:25,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-01 18:30:25,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:30:25,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:30:25,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:30:25,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2019-01-01 18:30:26,644 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 5 [2019-01-01 18:30:26,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:30:26,648 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:30:26,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-01 18:30:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:30:29,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:30:29,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-01 18:30:29,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 18:30:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 18:30:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=993, Unknown=12, NotChecked=0, Total=1122 [2019-01-01 18:30:29,449 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 34 states. [2019-01-01 18:30:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:30:31,037 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-01-01 18:30:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 18:30:31,039 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-01-01 18:30:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:30:31,040 INFO L225 Difference]: With dead ends: 68 [2019-01-01 18:30:31,040 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 18:30:31,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=278, Invalid=2160, Unknown=12, NotChecked=0, Total=2450 [2019-01-01 18:30:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 18:30:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 18:30:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 18:30:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 18:30:31,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-01-01 18:30:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:30:31,042 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 18:30:31,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 18:30:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 18:30:31,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 18:30:31,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:30:31 BoogieIcfgContainer [2019-01-01 18:30:31,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:30:31,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:30:31,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:30:31,049 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:30:31,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:29:12" (3/4) ... [2019-01-01 18:30:31,054 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 18:30:31,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-01-01 18:30:31,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-01-01 18:30:31,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-01-01 18:30:31,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-01-01 18:30:31,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-01-01 18:30:31,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-01-01 18:30:31,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 18:30:31,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-01-01 18:30:31,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-01-01 18:30:31,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-01-01 18:30:31,078 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-01-01 18:30:31,078 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 18:30:31,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 18:30:31,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 18:30:31,080 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 18:30:31,193 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 18:30:31,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:30:31,194 INFO L168 Benchmark]: Toolchain (without parser) took 82261.13 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 550.5 MB). Free memory was 947.3 MB in the beginning and 824.9 MB in the end (delta: 122.4 MB). Peak memory consumption was 672.9 MB. Max. memory is 11.5 GB. [2019-01-01 18:30:31,194 INFO L168 Benchmark]: CDTParser took 0.16 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:30:31,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 909.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-01 18:30:31,195 INFO L168 Benchmark]: Boogie Preprocessor took 111.37 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:30:31,195 INFO L168 Benchmark]: RCFGBuilder took 2288.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2019-01-01 18:30:31,196 INFO L168 Benchmark]: TraceAbstraction took 78803.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 415.8 MB). Free memory was 994.7 MB in the beginning and 824.9 MB in the end (delta: 169.8 MB). Peak memory consumption was 585.5 MB. Max. memory is 11.5 GB. [2019-01-01 18:30:31,196 INFO L168 Benchmark]: Witness Printer took 143.85 ms. Allocated memory is still 1.6 GB. Free memory was 824.9 MB in the beginning and 824.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 18:30:31,198 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.16 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 909.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.37 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 2288.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78803.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 415.8 MB). Free memory was 994.7 MB in the beginning and 824.9 MB in the end (delta: 169.8 MB). Peak memory consumption was 585.5 MB. Max. memory is 11.5 GB. * Witness Printer took 143.85 ms. Allocated memory is still 1.6 GB. Free memory was 824.9 MB in the beginning and 824.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1294]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1294]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1411]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1411]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1157]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1157]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1258]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1256]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1256]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1258]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1339]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1339]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1463]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1198]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1198]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1267]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1265]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1265]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1267]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1126]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1126]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1193]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1193]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1146]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1146]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 80 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 45 procedures, 346 locations, 80 error locations. SAFE Result, 78.7s OverallTime, 35 OverallIterations, 2 TraceHistogramMax, 45.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2191 SDtfs, 2828 SDslu, 11085 SDs, 0 SdLazy, 18171 SolverSat, 1103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1069 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5336 ImplicationChecksByTransitivity, 48.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 270 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 1528 NumberOfCodeBlocks, 1528 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1490 ConstructedInterpolants, 29 QuantifiedInterpolants, 758141 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1210 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 17/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...