./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer --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 50623fcce85e4b85b0accc998d09712632377f90 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:32:34,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:32:34,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:32:34,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:32:34,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:32:34,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:32:34,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:32:34,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:32:34,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:32:34,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:32:34,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:32:34,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:32:34,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:32:34,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:32:34,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:32:34,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:32:34,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:32:34,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:32:34,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:32:34,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:32:34,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:32:34,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:32:34,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:32:34,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:32:34,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:32:34,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:32:34,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:32:34,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:32:34,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:32:34,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:32:34,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:32:34,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:32:34,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:32:34,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:32:34,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:32:34,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:32:34,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:32:34,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:32:34,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:32:34,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:32:34,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:32:34,227 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:32:34,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:32:34,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:32:34,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:32:34,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:32:34,240 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:32:34,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:32:34,240 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:32:34,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:32:34,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:32:34,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:32:34,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:32:34,241 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:32:34,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:32:34,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:32:34,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:32:34,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:32:34,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:32:34,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:32:34,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:32:34,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:32:34,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:32:34,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:34,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:32:34,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:32:34,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:32:34,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:32:34,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer 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 -> 50623fcce85e4b85b0accc998d09712632377f90 [2019-11-15 23:32:34,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:32:34,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:32:34,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:32:34,285 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:32:34,285 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:32:34,286 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-15 23:32:34,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/data/ec5df219b/8c9c4563b0f643c2921dba02f41b3f79/FLAG4e86961f0 [2019-11-15 23:32:34,805 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:32:34,806 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-15 23:32:34,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/data/ec5df219b/8c9c4563b0f643c2921dba02f41b3f79/FLAG4e86961f0 [2019-11-15 23:32:35,304 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/data/ec5df219b/8c9c4563b0f643c2921dba02f41b3f79 [2019-11-15 23:32:35,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:32:35,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:32:35,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:35,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:32:35,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:32:35,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:35" (1/1) ... [2019-11-15 23:32:35,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1833de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:35, skipping insertion in model container [2019-11-15 23:32:35,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:35" (1/1) ... [2019-11-15 23:32:35,322 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:32:35,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:32:35,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:35,889 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:32:35,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:36,064 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:32:36,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36 WrapperNode [2019-11-15 23:32:36,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:36,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:32:36,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:32:36,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:32:36,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... [2019-11-15 23:32:36,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:32:36,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:32:36,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:32:36,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:32:36,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:32:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:32:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 23:32:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:32:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:32:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 23:32:36,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 23:32:36,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 23:32:36,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-15 23:32:36,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-15 23:32:36,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-15 23:32:36,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-15 23:32:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-15 23:32:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-15 23:32:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-15 23:32:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-15 23:32:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-15 23:32:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-15 23:32:36,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-15 23:32:36,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-15 23:32:36,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-15 23:32:36,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-15 23:32:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-15 23:32:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-15 23:32:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:32:36,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 23:32:36,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-15 23:32:36,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 23:32:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:32:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:32:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:32:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:32:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:32:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:32:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:32:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:32:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:32:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:32:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:32:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:32:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:32:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 23:32:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 23:32:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 23:32:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:32:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:32:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:32:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:32:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:32:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:32:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:32:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:32:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:32:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:32:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:32:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:32:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:32:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:32:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:32:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:32:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:32:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:32:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:32:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:32:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:32:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:32:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-15 23:32:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:32:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-15 23:32:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-15 23:32:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-15 23:32:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 23:32:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-15 23:32:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 23:32:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:32:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 23:32:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 23:32:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 23:32:36,874 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:32:37,069 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:32:37,349 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:32:37,350 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 23:32:37,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:37 BoogieIcfgContainer [2019-11-15 23:32:37,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:32:37,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:32:37,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:32:37,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:32:37,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:32:35" (1/3) ... [2019-11-15 23:32:37,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d1c253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:37, skipping insertion in model container [2019-11-15 23:32:37,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:36" (2/3) ... [2019-11-15 23:32:37,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d1c253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:37, skipping insertion in model container [2019-11-15 23:32:37,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:37" (3/3) ... [2019-11-15 23:32:37,358 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2019-11-15 23:32:37,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:32:37,374 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-11-15 23:32:37,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-11-15 23:32:37,401 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:32:37,405 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:32:37,406 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:32:37,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:32:37,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:32:37,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:32:37,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:32:37,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:32:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 23:32:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:32:37,442 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:37,442 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:37,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash -483950332, now seen corresponding path program 1 times [2019-11-15 23:32:37,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:37,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049403214] [2019-11-15 23:32:37,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:37,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:37,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:37,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049403214] [2019-11-15 23:32:37,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:37,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:37,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247048582] [2019-11-15 23:32:37,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:37,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:38,000 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-15 23:32:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:38,950 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2019-11-15 23:32:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:32:38,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-15 23:32:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:38,965 INFO L225 Difference]: With dead ends: 158 [2019-11-15 23:32:38,965 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 23:32:38,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:32:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 23:32:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2019-11-15 23:32:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 23:32:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-15 23:32:39,047 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-11-15 23:32:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:39,048 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-15 23:32:39,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-15 23:32:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:32:39,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:39,051 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:39,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash -483950331, now seen corresponding path program 1 times [2019-11-15 23:32:39,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:39,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390598915] [2019-11-15 23:32:39,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:39,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:39,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:39,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390598915] [2019-11-15 23:32:39,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:39,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:39,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750242939] [2019-11-15 23:32:39,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:39,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:39,283 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2019-11-15 23:32:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:40,041 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-15 23:32:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:32:40,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-15 23:32:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:40,042 INFO L225 Difference]: With dead ends: 119 [2019-11-15 23:32:40,043 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:32:40,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:32:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:32:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2019-11-15 23:32:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:32:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-15 23:32:40,053 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-11-15 23:32:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:40,053 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-15 23:32:40,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-15 23:32:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:32:40,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:40,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:40,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 841245344, now seen corresponding path program 1 times [2019-11-15 23:32:40,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:40,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159601554] [2019-11-15 23:32:40,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:40,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:40,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:40,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159601554] [2019-11-15 23:32:40,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:40,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:32:40,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90872023] [2019-11-15 23:32:40,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:40,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:40,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:40,193 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 10 states. [2019-11-15 23:32:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:41,126 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2019-11-15 23:32:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:32:41,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 23:32:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:41,128 INFO L225 Difference]: With dead ends: 157 [2019-11-15 23:32:41,129 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:32:41,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:32:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:32:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2019-11-15 23:32:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 23:32:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-15 23:32:41,139 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-11-15 23:32:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:41,139 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-15 23:32:41,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-15 23:32:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:32:41,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:41,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:41,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash 841245345, now seen corresponding path program 1 times [2019-11-15 23:32:41,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:41,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133983782] [2019-11-15 23:32:41,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:41,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:41,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:41,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133983782] [2019-11-15 23:32:41,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:41,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:32:41,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540383044] [2019-11-15 23:32:41,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:32:41,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:32:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:32:41,507 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 13 states. [2019-11-15 23:32:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:42,801 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2019-11-15 23:32:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:32:42,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-15 23:32:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:42,805 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:32:42,805 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 23:32:42,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:32:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 23:32:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 105. [2019-11-15 23:32:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:32:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-15 23:32:42,815 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-11-15 23:32:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:42,815 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-15 23:32:42,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:32:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-15 23:32:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:42,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:42,817 INFO L380 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-11-15 23:32:42,817 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 308801935, now seen corresponding path program 1 times [2019-11-15 23:32:42,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:42,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13146401] [2019-11-15 23:32:42,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:42,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:42,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:42,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13146401] [2019-11-15 23:32:42,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:42,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:32:42,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683875750] [2019-11-15 23:32:42,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:32:42,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:32:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:32:42,957 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 11 states. [2019-11-15 23:32:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:43,584 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2019-11-15 23:32:43,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:43,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-15 23:32:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:43,586 INFO L225 Difference]: With dead ends: 128 [2019-11-15 23:32:43,586 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 23:32:43,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:32:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 23:32:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2019-11-15 23:32:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:32:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-15 23:32:43,595 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-11-15 23:32:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:43,595 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-15 23:32:43,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:32:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-15 23:32:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:43,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:43,596 INFO L380 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-11-15 23:32:43,598 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash 308801936, now seen corresponding path program 1 times [2019-11-15 23:32:43,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:43,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330070722] [2019-11-15 23:32:43,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:43,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:43,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:43,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330070722] [2019-11-15 23:32:43,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:43,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:32:43,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604373136] [2019-11-15 23:32:43,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:32:43,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:32:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:32:43,784 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 12 states. [2019-11-15 23:32:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:44,645 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2019-11-15 23:32:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:44,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-15 23:32:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:44,647 INFO L225 Difference]: With dead ends: 126 [2019-11-15 23:32:44,647 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 23:32:44,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:32:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 23:32:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-15 23:32:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:32:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-11-15 23:32:44,654 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-11-15 23:32:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:44,654 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-11-15 23:32:44,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:32:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-11-15 23:32:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:44,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:44,656 INFO L380 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-11-15 23:32:44,656 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 437884654, now seen corresponding path program 1 times [2019-11-15 23:32:44,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:44,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990117740] [2019-11-15 23:32:44,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:44,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:44,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:44,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990117740] [2019-11-15 23:32:44,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:44,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:32:44,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50415851] [2019-11-15 23:32:44,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:32:44,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:32:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:32:44,750 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2019-11-15 23:32:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:45,124 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-11-15 23:32:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:32:45,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 23:32:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:45,126 INFO L225 Difference]: With dead ends: 109 [2019-11-15 23:32:45,126 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 23:32:45,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 23:32:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2019-11-15 23:32:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:32:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-15 23:32:45,132 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-11-15 23:32:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:45,132 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-15 23:32:45,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:32:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-15 23:32:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:45,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:45,133 INFO L380 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-11-15 23:32:45,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:45,134 INFO L82 PathProgramCache]: Analyzing trace with hash -308170174, now seen corresponding path program 1 times [2019-11-15 23:32:45,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:45,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599490175] [2019-11-15 23:32:45,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:45,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599490175] [2019-11-15 23:32:45,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:45,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:45,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607168864] [2019-11-15 23:32:45,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:32:45,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:32:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:32:45,273 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 8 states. [2019-11-15 23:32:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:45,779 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-11-15 23:32:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:32:45,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-15 23:32:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:45,781 INFO L225 Difference]: With dead ends: 107 [2019-11-15 23:32:45,781 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:32:45,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:32:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:32:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-15 23:32:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:32:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-11-15 23:32:45,786 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-11-15 23:32:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:45,787 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-11-15 23:32:45,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:32:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-11-15 23:32:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:45,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:45,788 INFO L380 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-11-15 23:32:45,788 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -179087455, now seen corresponding path program 1 times [2019-11-15 23:32:45,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:45,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396288674] [2019-11-15 23:32:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:45,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396288674] [2019-11-15 23:32:45,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:45,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:45,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086252514] [2019-11-15 23:32:45,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:32:45,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:32:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:32:45,952 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 9 states. [2019-11-15 23:32:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:46,660 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-15 23:32:46,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:32:46,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-15 23:32:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:46,661 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:32:46,661 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 23:32:46,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:32:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 23:32:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-11-15 23:32:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 23:32:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-15 23:32:46,667 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-11-15 23:32:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:46,667 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-15 23:32:46,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:32:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-15 23:32:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:46,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:46,668 INFO L380 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-11-15 23:32:46,669 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash -179087454, now seen corresponding path program 1 times [2019-11-15 23:32:46,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869669329] [2019-11-15 23:32:46,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:46,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869669329] [2019-11-15 23:32:46,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:46,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:46,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844663156] [2019-11-15 23:32:46,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:46,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:46,848 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 10 states. [2019-11-15 23:32:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:47,622 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-11-15 23:32:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:47,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 23:32:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:47,624 INFO L225 Difference]: With dead ends: 136 [2019-11-15 23:32:47,624 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 23:32:47,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:32:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 23:32:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 115. [2019-11-15 23:32:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 23:32:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-15 23:32:47,629 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2019-11-15 23:32:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:47,629 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-15 23:32:47,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-15 23:32:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:32:47,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:47,630 INFO L380 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-11-15 23:32:47,631 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 405917714, now seen corresponding path program 1 times [2019-11-15 23:32:47,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:47,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953016819] [2019-11-15 23:32:47,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:47,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:47,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:47,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953016819] [2019-11-15 23:32:47,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:47,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:32:47,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631262705] [2019-11-15 23:32:47,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:32:47,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:32:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:32:47,706 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 7 states. [2019-11-15 23:32:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:48,077 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-15 23:32:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:32:48,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 23:32:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:48,078 INFO L225 Difference]: With dead ends: 118 [2019-11-15 23:32:48,078 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:32:48,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:32:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-11-15 23:32:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:32:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-15 23:32:48,084 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 23 [2019-11-15 23:32:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:48,084 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-15 23:32:48,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:32:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-15 23:32:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:32:48,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:48,086 INFO L380 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-11-15 23:32:48,086 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash 405917715, now seen corresponding path program 1 times [2019-11-15 23:32:48,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:48,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615200548] [2019-11-15 23:32:48,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:48,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615200548] [2019-11-15 23:32:48,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:48,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 23:32:48,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795345177] [2019-11-15 23:32:48,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:32:48,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:32:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:32:48,406 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 14 states. [2019-11-15 23:32:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:49,724 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-15 23:32:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:32:49,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-11-15 23:32:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:49,725 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:32:49,725 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 23:32:49,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:32:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 23:32:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-11-15 23:32:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:32:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-11-15 23:32:49,731 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 23 [2019-11-15 23:32:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:49,731 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-11-15 23:32:49,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:32:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-11-15 23:32:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:32:49,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:49,732 INFO L380 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-11-15 23:32:49,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash 17927359, now seen corresponding path program 1 times [2019-11-15 23:32:49,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:49,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083479690] [2019-11-15 23:32:49,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:49,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083479690] [2019-11-15 23:32:49,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:49,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:32:49,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021246959] [2019-11-15 23:32:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:32:49,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:49,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:32:49,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:32:49,848 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 8 states. [2019-11-15 23:32:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:50,389 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-11-15 23:32:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:50,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-15 23:32:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:50,391 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:32:50,391 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:32:50,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:32:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:32:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2019-11-15 23:32:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:32:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-15 23:32:50,396 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 26 [2019-11-15 23:32:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:50,396 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-15 23:32:50,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:32:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-15 23:32:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:32:50,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:50,397 INFO L380 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-11-15 23:32:50,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash 17927360, now seen corresponding path program 1 times [2019-11-15 23:32:50,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:50,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107177945] [2019-11-15 23:32:50,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:50,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107177945] [2019-11-15 23:32:50,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:50,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:32:50,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455358395] [2019-11-15 23:32:50,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:50,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:50,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:50,603 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 10 states. [2019-11-15 23:32:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,244 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-11-15 23:32:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:32:51,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-15 23:32:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,245 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:32:51,245 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:32:51,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:32:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:32:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-11-15 23:32:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:32:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-15 23:32:51,250 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-11-15 23:32:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,250 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-15 23:32:51,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-15 23:32:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:32:51,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,251 INFO L380 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-11-15 23:32:51,252 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash -77771757, now seen corresponding path program 1 times [2019-11-15 23:32:51,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470278292] [2019-11-15 23:32:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:51,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470278292] [2019-11-15 23:32:51,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:51,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:32:51,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689181338] [2019-11-15 23:32:51,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:32:51,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:32:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:32:51,375 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 9 states. [2019-11-15 23:32:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,968 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-11-15 23:32:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:51,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-15 23:32:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,969 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:32:51,970 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:32:51,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:32:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:32:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-11-15 23:32:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 23:32:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-11-15 23:32:51,975 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-11-15 23:32:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,976 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-11-15 23:32:51,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:32:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-11-15 23:32:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:32:51,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,977 INFO L380 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-11-15 23:32:51,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -77771756, now seen corresponding path program 1 times [2019-11-15 23:32:51,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876508800] [2019-11-15 23:32:51,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:52,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876508800] [2019-11-15 23:32:52,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:32:52,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222466709] [2019-11-15 23:32:52,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:32:52,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:32:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:32:52,171 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 11 states. [2019-11-15 23:32:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,905 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-11-15 23:32:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:32:52,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-15 23:32:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,906 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:32:52,906 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 23:32:52,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:32:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 23:32:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-15 23:32:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 23:32:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-11-15 23:32:52,910 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2019-11-15 23:32:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,911 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-11-15 23:32:52,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:32:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-11-15 23:32:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:32:52,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,912 INFO L380 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-11-15 23:32:52,912 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash -902347424, now seen corresponding path program 1 times [2019-11-15 23:32:52,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357483832] [2019-11-15 23:32:52,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:53,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357483832] [2019-11-15 23:32:53,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:53,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 23:32:53,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855123330] [2019-11-15 23:32:53,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:32:53,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:32:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:32:53,201 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 17 states. [2019-11-15 23:32:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:54,322 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-11-15 23:32:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:32:54,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-15 23:32:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:54,323 INFO L225 Difference]: With dead ends: 121 [2019-11-15 23:32:54,324 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 23:32:54,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 23:32:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 23:32:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2019-11-15 23:32:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 23:32:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-11-15 23:32:54,328 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-11-15 23:32:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:54,328 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-11-15 23:32:54,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:32:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-11-15 23:32:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:32:54,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:54,329 INFO L380 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-11-15 23:32:54,330 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash -902347423, now seen corresponding path program 1 times [2019-11-15 23:32:54,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:54,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343996560] [2019-11-15 23:32:54,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:54,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343996560] [2019-11-15 23:32:54,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:54,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 23:32:54,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711763820] [2019-11-15 23:32:54,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:32:54,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:32:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:32:54,769 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 17 states. [2019-11-15 23:32:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:56,025 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-11-15 23:32:56,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:32:56,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-15 23:32:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:56,026 INFO L225 Difference]: With dead ends: 116 [2019-11-15 23:32:56,026 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 23:32:56,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:32:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 23:32:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2019-11-15 23:32:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:32:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-11-15 23:32:56,031 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 35 [2019-11-15 23:32:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:56,031 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-11-15 23:32:56,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:32:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-11-15 23:32:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:32:56,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:56,033 INFO L380 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-11-15 23:32:56,033 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1955028577, now seen corresponding path program 1 times [2019-11-15 23:32:56,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:56,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519647755] [2019-11-15 23:32:56,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:56,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:56,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519647755] [2019-11-15 23:32:56,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:56,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 23:32:56,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563684057] [2019-11-15 23:32:56,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:32:56,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:56,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:32:56,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:32:56,501 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 19 states. [2019-11-15 23:32:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:57,886 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-11-15 23:32:57,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:32:57,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-11-15 23:32:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:57,887 INFO L225 Difference]: With dead ends: 114 [2019-11-15 23:32:57,887 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 23:32:57,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 23:32:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 23:32:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-11-15 23:32:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:32:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-11-15 23:32:57,892 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2019-11-15 23:32:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:57,892 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-11-15 23:32:57,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:32:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-11-15 23:32:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:32:57,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:57,893 INFO L380 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-11-15 23:32:57,894 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1755658613, now seen corresponding path program 1 times [2019-11-15 23:32:57,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:57,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446388167] [2019-11-15 23:32:57,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:57,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:58,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-11-15 23:32:58,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446388167] [2019-11-15 23:32:58,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:58,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-15 23:32:58,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781749990] [2019-11-15 23:32:58,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:32:58,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:58,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:32:58,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:32:58,387 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 23 states. [2019-11-15 23:32:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:59,683 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-11-15 23:32:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:32:59,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-15 23:32:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:59,685 INFO L225 Difference]: With dead ends: 107 [2019-11-15 23:32:59,685 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:32:59,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1401, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 23:32:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:32:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-15 23:32:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:32:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-11-15 23:32:59,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 42 [2019-11-15 23:32:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:59,690 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-11-15 23:32:59,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:32:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-11-15 23:32:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:32:59,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:59,691 INFO L380 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-11-15 23:32:59,692 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:32:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash 192860954, now seen corresponding path program 1 times [2019-11-15 23:32:59,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:59,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589361260] [2019-11-15 23:32:59,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:59,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:00,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589361260] [2019-11-15 23:33:00,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:00,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-15 23:33:00,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98550384] [2019-11-15 23:33:00,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 23:33:00,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:00,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 23:33:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:33:00,799 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 27 states. [2019-11-15 23:33:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:03,271 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-11-15 23:33:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:33:03,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-11-15 23:33:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:03,272 INFO L225 Difference]: With dead ends: 105 [2019-11-15 23:33:03,272 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 23:33:03,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 23:33:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 23:33:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-11-15 23:33:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-15 23:33:03,276 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 44 [2019-11-15 23:33:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:03,276 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-15 23:33:03,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 23:33:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-15 23:33:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:33:03,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:03,277 INFO L380 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-11-15 23:33:03,278 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash 192860955, now seen corresponding path program 1 times [2019-11-15 23:33:03,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:03,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339646038] [2019-11-15 23:33:03,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:04,580 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-11-15 23:33:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:04,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339646038] [2019-11-15 23:33:04,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:04,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-11-15 23:33:04,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395599714] [2019-11-15 23:33:04,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 23:33:04,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 23:33:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:33:04,963 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 29 states. [2019-11-15 23:33:06,142 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-15 23:33:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:07,872 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-11-15 23:33:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:33:07,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-11-15 23:33:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:07,874 INFO L225 Difference]: With dead ends: 104 [2019-11-15 23:33:07,875 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:33:07,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=286, Invalid=2576, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 23:33:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:33:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-11-15 23:33:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-11-15 23:33:07,879 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 44 [2019-11-15 23:33:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:07,879 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-11-15 23:33:07,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 23:33:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-11-15 23:33:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:33:07,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:07,880 INFO L380 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-11-15 23:33:07,880 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1683722356, now seen corresponding path program 1 times [2019-11-15 23:33:07,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:07,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159743844] [2019-11-15 23:33:07,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:08,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159743844] [2019-11-15 23:33:08,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:08,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-11-15 23:33:08,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540885365] [2019-11-15 23:33:08,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 23:33:08,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 23:33:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:33:08,716 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 26 states. [2019-11-15 23:33:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:10,782 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-11-15 23:33:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:33:10,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-11-15 23:33:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:10,783 INFO L225 Difference]: With dead ends: 103 [2019-11-15 23:33:10,783 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 23:33:10,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=334, Invalid=2318, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 23:33:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 23:33:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-11-15 23:33:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-11-15 23:33:10,788 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 45 [2019-11-15 23:33:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:10,788 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-11-15 23:33:10,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 23:33:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-11-15 23:33:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:33:10,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:10,789 INFO L380 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-11-15 23:33:10,790 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1683722357, now seen corresponding path program 1 times [2019-11-15 23:33:10,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:10,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806632312] [2019-11-15 23:33:10,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:12,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806632312] [2019-11-15 23:33:12,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:12,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-11-15 23:33:12,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867742762] [2019-11-15 23:33:12,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 23:33:12,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 23:33:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:33:12,252 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 29 states. [2019-11-15 23:33:13,215 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-15 23:33:13,463 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-11-15 23:33:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:14,983 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-11-15 23:33:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:33:14,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2019-11-15 23:33:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:14,985 INFO L225 Difference]: With dead ends: 102 [2019-11-15 23:33:14,985 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 23:33:14,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=279, Invalid=2373, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 23:33:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 23:33:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-15 23:33:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-11-15 23:33:14,989 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 45 [2019-11-15 23:33:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:14,989 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-11-15 23:33:14,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 23:33:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-11-15 23:33:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:33:14,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:14,990 INFO L380 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-11-15 23:33:14,991 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1884851832, now seen corresponding path program 1 times [2019-11-15 23:33:14,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:14,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415370645] [2019-11-15 23:33:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:14,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:14,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:15,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415370645] [2019-11-15 23:33:15,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:15,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:33:15,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30058315] [2019-11-15 23:33:15,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:33:15,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:15,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:33:15,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:33:15,332 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 16 states. [2019-11-15 23:33:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:16,290 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-11-15 23:33:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:33:16,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-15 23:33:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:16,291 INFO L225 Difference]: With dead ends: 101 [2019-11-15 23:33:16,291 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 23:33:16,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:33:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 23:33:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-11-15 23:33:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-11-15 23:33:16,294 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 51 [2019-11-15 23:33:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:16,294 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-11-15 23:33:16,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:33:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-11-15 23:33:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:33:16,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:16,295 INFO L380 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-11-15 23:33:16,296 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1699135744, now seen corresponding path program 1 times [2019-11-15 23:33:16,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:16,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862762101] [2019-11-15 23:33:16,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:16,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862762101] [2019-11-15 23:33:16,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:16,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:33:16,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835827484] [2019-11-15 23:33:16,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:33:16,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:33:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:33:16,625 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 16 states. [2019-11-15 23:33:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:17,598 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-11-15 23:33:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:33:17,599 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-11-15 23:33:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:17,599 INFO L225 Difference]: With dead ends: 100 [2019-11-15 23:33:17,600 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 23:33:17,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:33:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 23:33:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 23:33:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-11-15 23:33:17,603 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 52 [2019-11-15 23:33:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:17,603 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-11-15 23:33:17,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:33:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-11-15 23:33:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:33:17,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:17,604 INFO L380 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-11-15 23:33:17,604 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1531209843, now seen corresponding path program 1 times [2019-11-15 23:33:17,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:17,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482406753] [2019-11-15 23:33:17,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:18,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482406753] [2019-11-15 23:33:18,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:18,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-11-15 23:33:18,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024043849] [2019-11-15 23:33:18,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 23:33:18,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 23:33:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:33:18,796 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 33 states. [2019-11-15 23:33:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:21,300 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-11-15 23:33:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 23:33:21,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2019-11-15 23:33:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:21,301 INFO L225 Difference]: With dead ends: 103 [2019-11-15 23:33:21,301 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 23:33:21,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=318, Invalid=3464, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 23:33:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 23:33:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-11-15 23:33:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:33:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-11-15 23:33:21,305 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 55 [2019-11-15 23:33:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:21,305 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-11-15 23:33:21,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 23:33:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-11-15 23:33:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:33:21,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:21,306 INFO L380 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-11-15 23:33:21,306 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1531209842, now seen corresponding path program 1 times [2019-11-15 23:33:21,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:21,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107452045] [2019-11-15 23:33:21,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:22,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107452045] [2019-11-15 23:33:22,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:22,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-11-15 23:33:22,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808557459] [2019-11-15 23:33:22,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 23:33:22,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 23:33:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:33:22,476 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 32 states. [2019-11-15 23:33:23,628 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-15 23:33:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:25,447 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-11-15 23:33:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 23:33:25,447 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2019-11-15 23:33:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:25,448 INFO L225 Difference]: With dead ends: 103 [2019-11-15 23:33:25,448 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 23:33:25,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=394, Invalid=3638, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 23:33:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 23:33:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-11-15 23:33:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:33:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-11-15 23:33:25,452 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 55 [2019-11-15 23:33:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:25,452 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-11-15 23:33:25,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 23:33:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-11-15 23:33:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:33:25,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:25,453 INFO L380 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-11-15 23:33:25,453 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -942125592, now seen corresponding path program 1 times [2019-11-15 23:33:25,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:25,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047326656] [2019-11-15 23:33:25,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:25,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047326656] [2019-11-15 23:33:25,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218393595] [2019-11-15 23:33:25,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:33:25,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:25,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:33:25,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2019-11-15 23:33:25,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892937862] [2019-11-15 23:33:25,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:33:25,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:33:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:33:25,846 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 6 states. [2019-11-15 23:33:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:25,949 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-11-15 23:33:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:25,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 23:33:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:25,951 INFO L225 Difference]: With dead ends: 100 [2019-11-15 23:33:25,951 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 23:33:25,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:33:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 23:33:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 23:33:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:33:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-11-15 23:33:25,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 60 [2019-11-15 23:33:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:25,955 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-11-15 23:33:25,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:33:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-11-15 23:33:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:33:25,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:25,956 INFO L380 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-11-15 23:33:26,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:26,157 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -942125591, now seen corresponding path program 1 times [2019-11-15 23:33:26,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:26,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048421355] [2019-11-15 23:33:26,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:26,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048421355] [2019-11-15 23:33:26,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439662489] [2019-11-15 23:33:26,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-15 23:33:26,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:26,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:33:26,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 23:33:27,498 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10|], 2=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_10|]} [2019-11-15 23:33:27,506 INFO L375 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 43 treesize of output 23 [2019-11-15 23:33:27,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2019-11-15 23:33:27,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:7 [2019-11-15 23:33:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:27,571 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:27,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 31 [2019-11-15 23:33:27,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565364295] [2019-11-15 23:33:27,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 23:33:27,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 23:33:27,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:33:27,572 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 32 states. [2019-11-15 23:33:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:30,288 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-11-15 23:33:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:33:30,289 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-11-15 23:33:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:30,290 INFO L225 Difference]: With dead ends: 118 [2019-11-15 23:33:30,290 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:33:30,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=394, Invalid=3266, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 23:33:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:33:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-11-15 23:33:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 23:33:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-11-15 23:33:30,295 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 60 [2019-11-15 23:33:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:30,295 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-11-15 23:33:30,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 23:33:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-11-15 23:33:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:33:30,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:30,296 INFO L380 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-11-15 23:33:30,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:30,498 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 729310972, now seen corresponding path program 1 times [2019-11-15 23:33:30,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:30,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023134007] [2019-11-15 23:33:30,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:30,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:30,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:30,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023134007] [2019-11-15 23:33:30,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:30,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:33:30,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4299507] [2019-11-15 23:33:30,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:33:30,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:33:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:33:30,710 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 12 states. [2019-11-15 23:33:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:31,406 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-11-15 23:33:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:33:31,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-11-15 23:33:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:31,407 INFO L225 Difference]: With dead ends: 109 [2019-11-15 23:33:31,407 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 23:33:31,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:33:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 23:33:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-15 23:33:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 23:33:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-11-15 23:33:31,410 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 62 [2019-11-15 23:33:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:31,410 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-11-15 23:33:31,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:33:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-11-15 23:33:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:33:31,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:31,411 INFO L380 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-11-15 23:33:31,412 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 729310973, now seen corresponding path program 1 times [2019-11-15 23:33:31,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:31,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116543255] [2019-11-15 23:33:31,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:33:31,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116543255] [2019-11-15 23:33:31,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:31,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-15 23:33:31,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439700799] [2019-11-15 23:33:31,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 23:33:31,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 23:33:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:33:31,950 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 21 states. [2019-11-15 23:33:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:32,988 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-11-15 23:33:32,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:33:32,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-11-15 23:33:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:32,994 INFO L225 Difference]: With dead ends: 107 [2019-11-15 23:33:32,994 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:33:32,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 23:33:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:33:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-15 23:33:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:33:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-11-15 23:33:32,998 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 62 [2019-11-15 23:33:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:32,998 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-11-15 23:33:32,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 23:33:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-11-15 23:33:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:33:32,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:32,999 INFO L380 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-11-15 23:33:32,999 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1715256994, now seen corresponding path program 1 times [2019-11-15 23:33:33,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:33,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39701161] [2019-11-15 23:33:33,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:34,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39701161] [2019-11-15 23:33:34,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786933908] [2019-11-15 23:33:34,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:34,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 152 conjunts are in the unsatisfiable core [2019-11-15 23:33:34,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:34,847 INFO L375 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 3 [2019-11-15 23:33:34,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,862 INFO L375 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 3 [2019-11-15 23:33:34,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 23:33:35,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:33:35,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:33:35,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-15 23:33:35,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:35,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:33:35,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:35,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:33:35,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2019-11-15 23:33:35,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:35,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 84 [2019-11-15 23:33:35,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,682 INFO L567 ElimStorePlain]: treesize reduction 46, result has 58.6 percent of original size [2019-11-15 23:33:35,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:35,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:35,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 84 [2019-11-15 23:33:35,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,792 INFO L567 ElimStorePlain]: treesize reduction 36, result has 68.7 percent of original size [2019-11-15 23:33:35,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:35,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:100 [2019-11-15 23:33:36,163 INFO L375 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 27 treesize of output 19 [2019-11-15 23:33:36,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,180 INFO L375 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 27 treesize of output 19 [2019-11-15 23:33:36,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:78 [2019-11-15 23:33:36,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:36,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:36,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2019-11-15 23:33:36,633 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:36,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,661 INFO L375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2019-11-15 23:33:36,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:7 [2019-11-15 23:33:36,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:33:36,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:36,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:36,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-15 23:33:37,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:37,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:37,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:37,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:37,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 157 [2019-11-15 23:33:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,097 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:37,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:37,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:37,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:37,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 116 treesize of output 174 [2019-11-15 23:33:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,223 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:37,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:37,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:37,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:153 [2019-11-15 23:33:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:38,113 INFO L375 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 15 treesize of output 7 [2019-11-15 23:33:38,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:38,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:38,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:38,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2019-11-15 23:33:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:38,328 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:38,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 37] total 69 [2019-11-15 23:33:38,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877382552] [2019-11-15 23:33:38,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 23:33:38,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:38,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 23:33:38,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=4514, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 23:33:38,330 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 69 states. [2019-11-15 23:33:40,023 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-11-15 23:33:40,242 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-11-15 23:33:40,645 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-15 23:33:41,468 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-11-15 23:33:45,560 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-11-15 23:33:45,791 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-11-15 23:33:46,022 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-15 23:33:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:48,326 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2019-11-15 23:33:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 23:33:48,326 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 64 [2019-11-15 23:33:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:48,327 INFO L225 Difference]: With dead ends: 69 [2019-11-15 23:33:48,327 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:33:48,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=736, Invalid=11036, Unknown=0, NotChecked=0, Total=11772 [2019-11-15 23:33:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:33:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-15 23:33:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-15 23:33:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2019-11-15 23:33:48,333 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 64 [2019-11-15 23:33:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:48,333 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2019-11-15 23:33:48,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 23:33:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2019-11-15 23:33:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:33:48,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:48,334 INFO L380 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-11-15 23:33:48,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:48,538 INFO L410 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_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 23:33:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -983834672, now seen corresponding path program 1 times [2019-11-15 23:33:48,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:48,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272761756] [2019-11-15 23:33:48,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:48,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:48,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:48,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272761756] [2019-11-15 23:33:48,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984805081] [2019-11-15 23:33:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:49,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 23:33:49,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:49,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 23:33:49,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:49,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:49,385 INFO L496 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-11-15 23:33:49,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-11-15 23:33:49,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:33:49,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:49,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:49,480 INFO L496 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-11-15 23:33:49,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-15 23:33:49,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 23:33:49,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:49,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:49,594 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_14| vanished before elimination [2019-11-15 23:33:49,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:49,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2019-11-15 23:33:49,712 INFO L375 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 12 [2019-11-15 23:33:49,712 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:49,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:49,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:49,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2019-11-15 23:33:49,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 23:33:49,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:49,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:49,758 INFO L496 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-11-15 23:33:49,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-11-15 23:33:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:49,879 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:49,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2019-11-15 23:33:49,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361270597] [2019-11-15 23:33:49,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 23:33:49,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 23:33:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 23:33:49,881 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 39 states. [2019-11-15 23:33:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:51,415 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-11-15 23:33:51,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:33:51,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2019-11-15 23:33:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:51,416 INFO L225 Difference]: With dead ends: 68 [2019-11-15 23:33:51,416 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:33:51,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=393, Invalid=3147, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 23:33:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:33:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:33:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:33:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:33:51,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-11-15 23:33:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:51,417 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:33:51,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 23:33:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:33:51,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:33:51,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:51,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:33:51 BoogieIcfgContainer [2019-11-15 23:33:51,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:33:51,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:51,623 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:51,623 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:51,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:37" (3/4) ... [2019-11-15 23:33:51,626 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-15 23:33:51,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-15 23:33:51,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 23:33:51,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-15 23:33:51,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-15 23:33:51,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:33:51,638 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-15 23:33:51,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-15 23:33:51,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-15 23:33:51,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-15 23:33:51,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-15 23:33:51,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-15 23:33:51,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-11-15 23:33:51,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-15 23:33:51,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:33:51,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:33:51,649 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:33:51,719 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3cc9e2ca-49fa-4cbd-bf4b-0cfc2b81aa63/bin/uautomizer/witness.graphml [2019-11-15 23:33:51,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:51,720 INFO L168 Benchmark]: Toolchain (without parser) took 76413.31 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 892.9 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -75.6 MB). Peak memory consumption was 817.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,721 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:51,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,721 INFO L168 Benchmark]: Boogie Preprocessor took 145.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:51,722 INFO L168 Benchmark]: RCFGBuilder took 1140.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.8 MB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,728 INFO L168 Benchmark]: TraceAbstraction took 74270.49 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 774.9 MB). Free memory was 961.8 MB in the beginning and 1.0 GB in the end (delta: -59.0 MB). Peak memory consumption was 715.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,729 INFO L168 Benchmark]: Witness Printer took 96.55 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,731 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 756.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 145.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1140.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.8 MB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74270.49 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 774.9 MB). Free memory was 961.8 MB in the beginning and 1.0 GB in the end (delta: -59.0 MB). Peak memory consumption was 715.9 MB. Max. memory is 11.5 GB. * Witness Printer took 96.55 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 782]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 774]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 774]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 774]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 772]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 80 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 48 procedures, 355 locations, 80 error locations. Result: SAFE, OverallTime: 74.2s, OverallIterations: 34, TraceHistogramMax: 2, AutomataDifference: 50.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1624 SDtfs, 5149 SDslu, 4979 SDs, 0 SdLazy, 29901 SolverSat, 2295 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1475 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 1030 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7693 ImplicationChecksByTransitivity, 40.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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 343 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1525 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1487 ConstructedInterpolants, 33 QuantifiedInterpolants, 889137 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 38 InterpolantComputations, 31 PerfectInterpolantSequences, 17/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...