./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.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_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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 238bdb5f7d99ba2e1fec6ce0d5e4dc0227502909 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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 238bdb5f7d99ba2e1fec6ce0d5e4dc0227502909 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:38,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:38,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:38,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:38,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:38,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:38,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:38,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:38,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:38,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:38,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:38,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:38,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:38,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:38,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:38,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:38,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:38,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:38,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:38,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:38,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:38,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:38,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:38,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:38,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:38,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:38,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:38,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:38,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:38,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:38,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:38,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:38,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:38,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:38,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:38,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:38,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:38,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:38,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:38,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:38,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:38,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:06:38,547 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:38,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:38,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:38,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:38,549 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:38,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:38,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:38,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:06:38,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:38,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:38,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:38,550 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:06:38,551 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:06:38,551 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:06:38,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:38,551 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:38,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:38,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:38,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:38,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:38,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:38,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:38,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:38,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:38,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:38,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:06:38,554 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_1ec460c2-9b78-47c3-ba26-11565bce2641/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 -> 238bdb5f7d99ba2e1fec6ce0d5e4dc0227502909 [2019-11-16 00:06:38,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:38,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:38,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:38,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:38,601 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:38,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2019-11-16 00:06:38,658 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/b9eab0fd9/60b73d2dbd1c49c78e21d30c35c837c9/FLAG88e12d071 [2019-11-16 00:06:39,191 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:39,193 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2019-11-16 00:06:39,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/b9eab0fd9/60b73d2dbd1c49c78e21d30c35c837c9/FLAG88e12d071 [2019-11-16 00:06:39,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/b9eab0fd9/60b73d2dbd1c49c78e21d30c35c837c9 [2019-11-16 00:06:39,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:39,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:06:39,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:39,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:39,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:39,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:39" (1/1) ... [2019-11-16 00:06:39,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71136f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:39, skipping insertion in model container [2019-11-16 00:06:39,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:39" (1/1) ... [2019-11-16 00:06:39,687 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:39,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:40,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:40,199 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:40,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:40,341 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:40,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40 WrapperNode [2019-11-16 00:06:40,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:40,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:40,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:40,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:40,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... [2019-11-16 00:06:40,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:40,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:40,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:40,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:40,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:06:40,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:06:40,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:40,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-16 00:06:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:06:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:06:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:06:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:06:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:06:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-16 00:06:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-16 00:06:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-16 00:06:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-16 00:06:40,579 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-16 00:06:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-16 00:06:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-16 00:06:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-16 00:06:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-16 00:06:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-16 00:06:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-16 00:06:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-16 00:06:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-16 00:06:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-16 00:06:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-16 00:06:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-16 00:06:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-16 00:06:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-16 00:06:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-16 00:06:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-16 00:06:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-16 00:06:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-16 00:06:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-16 00:06:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-16 00:06:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2019-11-16 00:06:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_3_11 [2019-11-16 00:06:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2019-11-16 00:06:40,589 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-16 00:06:40,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:06:40,589 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-16 00:06:40,589 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-16 00:06:40,590 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-16 00:06:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:06:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:06:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:06:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:06:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:06:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:06:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:06:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:06:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:06:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:06:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:06:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:06:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:06:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:06:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:06:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:06:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:06:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:06:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:06:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:06:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:06:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:06:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:06:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:06:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:06:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:06:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:06:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:06:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:06:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:06:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:06:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:06:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:06:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:06:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:06:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:06:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:06:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:06:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:06:40,607 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:06:40,607 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:06:40,607 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:06:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:06:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:06:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:06:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:06:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:06:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:06:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:06:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:06:40,622 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:06:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-16 00:06:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-16 00:06:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:06:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-16 00:06:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-16 00:06:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-16 00:06:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-16 00:06:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-16 00:06:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-16 00:06:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:06:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:06:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-16 00:06:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-16 00:06:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2019-11-16 00:06:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_3_11 [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:06:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:06:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-16 00:06:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-16 00:06:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-16 00:06:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-16 00:06:41,129 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:06:41,338 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:06:41,679 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:41,679 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-16 00:06:41,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:41 BoogieIcfgContainer [2019-11-16 00:06:41,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:41,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:41,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:41,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:41,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:39" (1/3) ... [2019-11-16 00:06:41,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b310c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:41, skipping insertion in model container [2019-11-16 00:06:41,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:40" (2/3) ... [2019-11-16 00:06:41,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b310c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:41, skipping insertion in model container [2019-11-16 00:06:41,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:41" (3/3) ... [2019-11-16 00:06:41,687 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2019-11-16 00:06:41,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:41,706 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 93 error locations. [2019-11-16 00:06:41,716 INFO L249 AbstractCegarLoop]: Starting to check reachability of 93 error locations. [2019-11-16 00:06:41,733 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:41,733 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:06:41,733 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:41,733 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:41,733 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:41,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:41,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:41,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2019-11-16 00:06:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:06:41,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:41,763 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:41,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 484065275, now seen corresponding path program 1 times [2019-11-16 00:06:41,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:41,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454358910] [2019-11-16 00:06:41,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:41,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:41,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,151 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-16 00:06:42,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454358910] [2019-11-16 00:06:42,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:42,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:06:42,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925566772] [2019-11-16 00:06:42,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:06:42,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:06:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:42,178 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 8 states. [2019-11-16 00:06:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:43,213 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2019-11-16 00:06:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:43,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-16 00:06:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:43,228 INFO L225 Difference]: With dead ends: 195 [2019-11-16 00:06:43,228 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:06:43,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:06:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 105. [2019-11-16 00:06:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:06:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-11-16 00:06:43,292 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 16 [2019-11-16 00:06:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:43,292 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-11-16 00:06:43,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:06:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-11-16 00:06:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:06:43,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:43,294 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:43,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -308875109, now seen corresponding path program 1 times [2019-11-16 00:06:43,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:43,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540144970] [2019-11-16 00:06:43,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:43,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:43,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:43,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540144970] [2019-11-16 00:06:43,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:43,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:43,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047889878] [2019-11-16 00:06:43,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:43,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:43,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:43,421 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 7 states. [2019-11-16 00:06:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:44,089 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2019-11-16 00:06:44,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:44,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-16 00:06:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:44,092 INFO L225 Difference]: With dead ends: 188 [2019-11-16 00:06:44,092 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:06:44,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:06:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 109. [2019-11-16 00:06:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-16 00:06:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-11-16 00:06:44,111 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 21 [2019-11-16 00:06:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:44,112 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-11-16 00:06:44,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-11-16 00:06:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:06:44,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:44,113 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:44,114 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash -308875076, now seen corresponding path program 1 times [2019-11-16 00:06:44,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330343285] [2019-11-16 00:06:44,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:06:44,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330343285] [2019-11-16 00:06:44,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900209682] [2019-11-16 00:06:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:06:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:06:44,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:44,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:06:44,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:44,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:44,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:44,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:06:44,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:44,579 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:06:44,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:44,614 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:06:44,614 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-16 00:06:44,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-16 00:06:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:44,627 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:44,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-16 00:06:44,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597948479] [2019-11-16 00:06:44,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:06:44,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:44,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:06:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:44,629 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 10 states. [2019-11-16 00:06:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:45,838 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-11-16 00:06:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:06:45,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-16 00:06:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:45,843 INFO L225 Difference]: With dead ends: 205 [2019-11-16 00:06:45,843 INFO L226 Difference]: Without dead ends: 205 [2019-11-16 00:06:45,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:06:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-16 00:06:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 124. [2019-11-16 00:06:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:06:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2019-11-16 00:06:45,858 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 21 [2019-11-16 00:06:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:45,859 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2019-11-16 00:06:45,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:06:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2019-11-16 00:06:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:06:45,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:45,860 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:46,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:46,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -308875075, now seen corresponding path program 1 times [2019-11-16 00:06:46,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:46,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796166412] [2019-11-16 00:06:46,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:46,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:46,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:06:46,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796166412] [2019-11-16 00:06:46,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584892747] [2019-11-16 00:06:46,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:06:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:06:46,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:46,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:06:46,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-16 00:06:46,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,574 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:06:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,595 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-16 00:06:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:06:46,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:18 [2019-11-16 00:06:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:46,661 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:46,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-16 00:06:46,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080174107] [2019-11-16 00:06:46,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:06:46,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:06:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:06:46,663 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 17 states. [2019-11-16 00:06:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:48,634 INFO L93 Difference]: Finished difference Result 313 states and 359 transitions. [2019-11-16 00:06:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:06:48,634 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-11-16 00:06:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:48,637 INFO L225 Difference]: With dead ends: 313 [2019-11-16 00:06:48,637 INFO L226 Difference]: Without dead ends: 313 [2019-11-16 00:06:48,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:06:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-16 00:06:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 155. [2019-11-16 00:06:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:06:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2019-11-16 00:06:48,656 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 21 [2019-11-16 00:06:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:48,656 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2019-11-16 00:06:48,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:06:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2019-11-16 00:06:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:06:48,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:48,658 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:48,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:48,862 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -602278083, now seen corresponding path program 1 times [2019-11-16 00:06:48,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:48,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772544492] [2019-11-16 00:06:48,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:48,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:48,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772544492] [2019-11-16 00:06:48,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683481461] [2019-11-16 00:06:48,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:06:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:06:49,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:49,116 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-16 00:06:49,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:49,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-16 00:06:49,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768140473] [2019-11-16 00:06:49,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:49,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:49,118 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand 5 states. [2019-11-16 00:06:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:49,144 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2019-11-16 00:06:49,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:49,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-16 00:06:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:49,146 INFO L225 Difference]: With dead ends: 142 [2019-11-16 00:06:49,146 INFO L226 Difference]: Without dead ends: 138 [2019-11-16 00:06:49,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-16 00:06:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-16 00:06:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-16 00:06:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2019-11-16 00:06:49,164 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 21 [2019-11-16 00:06:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:49,164 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2019-11-16 00:06:49,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2019-11-16 00:06:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:06:49,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:49,165 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:49,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:49,371 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -97689649, now seen corresponding path program 1 times [2019-11-16 00:06:49,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:49,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878412003] [2019-11-16 00:06:49,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:49,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:49,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:49,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878412003] [2019-11-16 00:06:49,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315422827] [2019-11-16 00:06:49,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:06:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:49,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:49,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:49,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:49,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-16 00:06:49,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539047681] [2019-11-16 00:06:49,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:49,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:49,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:49,619 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 7 states. [2019-11-16 00:06:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:50,029 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2019-11-16 00:06:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:50,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-16 00:06:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:50,031 INFO L225 Difference]: With dead ends: 141 [2019-11-16 00:06:50,031 INFO L226 Difference]: Without dead ends: 141 [2019-11-16 00:06:50,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-16 00:06:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-11-16 00:06:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:06:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2019-11-16 00:06:50,039 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 22 [2019-11-16 00:06:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:50,039 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2019-11-16 00:06:50,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2019-11-16 00:06:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:06:50,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:50,041 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:50,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:50,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1654818782, now seen corresponding path program 1 times [2019-11-16 00:06:50,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:50,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945050536] [2019-11-16 00:06:50,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:50,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:50,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:50,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945050536] [2019-11-16 00:06:50,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726156257] [2019-11-16 00:06:50,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:50,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:06:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:50,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:50,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-16 00:06:50,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388454325] [2019-11-16 00:06:50,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:06:50,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:06:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:06:50,669 INFO L87 Difference]: Start difference. First operand 137 states and 164 transitions. Second operand 13 states. [2019-11-16 00:06:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:51,584 INFO L93 Difference]: Finished difference Result 166 states and 198 transitions. [2019-11-16 00:06:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:51,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-16 00:06:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:51,586 INFO L225 Difference]: With dead ends: 166 [2019-11-16 00:06:51,586 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:06:51,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:06:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:06:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2019-11-16 00:06:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:06:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2019-11-16 00:06:51,593 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 26 [2019-11-16 00:06:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:51,594 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2019-11-16 00:06:51,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:06:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2019-11-16 00:06:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:06:51,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:51,595 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:51,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:51,797 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1767260329, now seen corresponding path program 1 times [2019-11-16 00:06:51,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:51,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022053206] [2019-11-16 00:06:51,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:51,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:51,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:06:51,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022053206] [2019-11-16 00:06:51,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:51,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:51,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487992666] [2019-11-16 00:06:51,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:51,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:51,899 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand 7 states. [2019-11-16 00:06:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:52,245 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2019-11-16 00:06:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:52,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-16 00:06:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:52,247 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:06:52,247 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:06:52,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:06:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2019-11-16 00:06:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:06:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2019-11-16 00:06:52,258 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 29 [2019-11-16 00:06:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:52,259 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2019-11-16 00:06:52,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2019-11-16 00:06:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:06:52,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:52,262 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:52,264 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1767260379, now seen corresponding path program 1 times [2019-11-16 00:06:52,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:52,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166922228] [2019-11-16 00:06:52,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:52,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:52,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:06:52,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166922228] [2019-11-16 00:06:52,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654870183] [2019-11-16 00:06:52,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:52,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:06:52,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:52,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:06:52,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:52,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:52,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:52,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:06:52,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:52,623 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:06:52,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:52,647 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:06:52,647 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-16 00:06:52,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-16 00:06:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:52,654 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:52,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-16 00:06:52,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651420537] [2019-11-16 00:06:52,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:06:52,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:06:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:52,655 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand 10 states. [2019-11-16 00:06:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:53,578 INFO L93 Difference]: Finished difference Result 178 states and 211 transitions. [2019-11-16 00:06:53,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:53,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-16 00:06:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:53,579 INFO L225 Difference]: With dead ends: 178 [2019-11-16 00:06:53,579 INFO L226 Difference]: Without dead ends: 178 [2019-11-16 00:06:53,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:06:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-16 00:06:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 145. [2019-11-16 00:06:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-16 00:06:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-11-16 00:06:53,586 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 29 [2019-11-16 00:06:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:53,587 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-11-16 00:06:53,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:06:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-11-16 00:06:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:06:53,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:53,588 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:53,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:53,792 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1767260380, now seen corresponding path program 1 times [2019-11-16 00:06:53,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:53,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777983410] [2019-11-16 00:06:53,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:53,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:06:53,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777983410] [2019-11-16 00:06:53,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537018348] [2019-11-16 00:06:53,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:54,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:06:54,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:54,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:06:54,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:54,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:54,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:54,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:06:54,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:54,279 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:06:54,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:54,293 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:06:54,294 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-16 00:06:54,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-16 00:06:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:06:54,315 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:54,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-16 00:06:54,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012595213] [2019-11-16 00:06:54,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:06:54,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:06:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:06:54,316 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 16 states. [2019-11-16 00:06:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:55,436 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2019-11-16 00:06:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:06:55,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-16 00:06:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:55,438 INFO L225 Difference]: With dead ends: 217 [2019-11-16 00:06:55,438 INFO L226 Difference]: Without dead ends: 217 [2019-11-16 00:06:55,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:06:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-16 00:06:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 163. [2019-11-16 00:06:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-16 00:06:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2019-11-16 00:06:55,447 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 29 [2019-11-16 00:06:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2019-11-16 00:06:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:06:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2019-11-16 00:06:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:06:55,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:55,449 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:55,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:55,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1261701754, now seen corresponding path program 1 times [2019-11-16 00:06:55,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:55,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724398149] [2019-11-16 00:06:55,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:55,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:55,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:06:55,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724398149] [2019-11-16 00:06:55,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313720097] [2019-11-16 00:06:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:55,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:06:55,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:06:55,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:55,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-16 00:06:55,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849780114] [2019-11-16 00:06:55,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:55,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:55,909 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand 5 states. [2019-11-16 00:06:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:55,940 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2019-11-16 00:06:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:55,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-16 00:06:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:55,943 INFO L225 Difference]: With dead ends: 138 [2019-11-16 00:06:55,943 INFO L226 Difference]: Without dead ends: 134 [2019-11-16 00:06:55,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-16 00:06:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-16 00:06:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:06:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2019-11-16 00:06:55,948 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 29 [2019-11-16 00:06:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:55,949 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2019-11-16 00:06:55,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2019-11-16 00:06:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:06:55,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:55,950 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:56,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:56,158 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -162000518, now seen corresponding path program 1 times [2019-11-16 00:06:56,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:56,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476178114] [2019-11-16 00:06:56,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:06:56,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476178114] [2019-11-16 00:06:56,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402364545] [2019-11-16 00:06:56,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:56,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:56,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:06:56,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:56,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-16 00:06:56,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243987830] [2019-11-16 00:06:56,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:56,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:56,445 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 7 states. [2019-11-16 00:06:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:56,720 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2019-11-16 00:06:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:56,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-16 00:06:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:56,722 INFO L225 Difference]: With dead ends: 135 [2019-11-16 00:06:56,722 INFO L226 Difference]: Without dead ends: 135 [2019-11-16 00:06:56,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-16 00:06:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2019-11-16 00:06:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:06:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2019-11-16 00:06:56,727 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 30 [2019-11-16 00:06:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:56,728 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2019-11-16 00:06:56,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2019-11-16 00:06:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:06:56,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:56,729 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:56,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:56,934 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 745314190, now seen corresponding path program 1 times [2019-11-16 00:06:56,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:56,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811614363] [2019-11-16 00:06:56,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:06:57,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811614363] [2019-11-16 00:06:57,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:57,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:06:57,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606846518] [2019-11-16 00:06:57,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:06:57,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:06:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:57,088 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 9 states. [2019-11-16 00:06:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:57,468 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2019-11-16 00:06:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:57,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-11-16 00:06:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:57,470 INFO L225 Difference]: With dead ends: 143 [2019-11-16 00:06:57,470 INFO L226 Difference]: Without dead ends: 143 [2019-11-16 00:06:57,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-16 00:06:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2019-11-16 00:06:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-16 00:06:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2019-11-16 00:06:57,475 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 32 [2019-11-16 00:06:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:57,475 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2019-11-16 00:06:57,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:06:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2019-11-16 00:06:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:06:57,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:57,476 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:57,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 745314191, now seen corresponding path program 1 times [2019-11-16 00:06:57,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:57,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43821231] [2019-11-16 00:06:57,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:57,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:57,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:06:57,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43821231] [2019-11-16 00:06:57,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182613814] [2019-11-16 00:06:57,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:06:57,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:57,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:57,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-16 00:06:57,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:57,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:57,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:57,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:06:57,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:57,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:57,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:57,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-11-16 00:06:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:06:57,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:57,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-11-16 00:06:57,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386064047] [2019-11-16 00:06:57,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:06:57,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:06:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:06:57,953 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 8 states. [2019-11-16 00:06:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:58,541 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2019-11-16 00:06:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:58,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-16 00:06:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:58,543 INFO L225 Difference]: With dead ends: 150 [2019-11-16 00:06:58,543 INFO L226 Difference]: Without dead ends: 150 [2019-11-16 00:06:58,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:06:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-16 00:06:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 129. [2019-11-16 00:06:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-16 00:06:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-11-16 00:06:58,548 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 32 [2019-11-16 00:06:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:58,549 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-11-16 00:06:58,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:06:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-11-16 00:06:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:06:58,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:58,550 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:58,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:58,751 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:06:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1012592913, now seen corresponding path program 1 times [2019-11-16 00:06:58,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:58,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895990447] [2019-11-16 00:06:58,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:58,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:58,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:06:58,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895990447] [2019-11-16 00:06:58,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592188480] [2019-11-16 00:06:58,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:59,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-16 00:06:59,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:59,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:06:59,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:06:59,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:06:59,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:06:59,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:06:59,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-16 00:07:01,210 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_4 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_8 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_8 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_8) v_entry_point_~c11~0.offset_BEFORE_CALL_4)))) is different from true [2019-11-16 00:07:01,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:01,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-16 00:07:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:01,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:01,261 INFO L567 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2019-11-16 00:07:01,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:01,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2019-11-16 00:07:01,334 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 25 treesize of output 13 [2019-11-16 00:07:01,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:01,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:01,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:01,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-16 00:07:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-11-16 00:07:01,346 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:01,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 20 [2019-11-16 00:07:01,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073593425] [2019-11-16 00:07:01,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:07:01,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:07:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=337, Unknown=1, NotChecked=36, Total=420 [2019-11-16 00:07:01,347 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 21 states. [2019-11-16 00:07:05,524 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-16 00:07:09,557 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-16 00:07:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:12,338 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2019-11-16 00:07:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:07:12,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-16 00:07:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:12,341 INFO L225 Difference]: With dead ends: 147 [2019-11-16 00:07:12,341 INFO L226 Difference]: Without dead ends: 147 [2019-11-16 00:07:12,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=4, NotChecked=60, Total=1056 [2019-11-16 00:07:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-16 00:07:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2019-11-16 00:07:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-16 00:07:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-11-16 00:07:12,347 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 34 [2019-11-16 00:07:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:12,348 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-11-16 00:07:12,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:07:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-11-16 00:07:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:07:12,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:12,349 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:12,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:12,552 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:07:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1012592912, now seen corresponding path program 1 times [2019-11-16 00:07:12,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:12,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604614190] [2019-11-16 00:07:12,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:12,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:12,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:07:12,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604614190] [2019-11-16 00:07:12,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097770572] [2019-11-16 00:07:12,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:07:12,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:12,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:07:12,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:13,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:07:13,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:13,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:07:13,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:13,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:07:13,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:07:13,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:13,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:07:13,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:13,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:13,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-16 00:07:15,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_11 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_6 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_11) v_entry_point_~c11~0.offset_BEFORE_CALL_6)))) is different from true [2019-11-16 00:07:15,194 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2019-11-16 00:07:15,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:15,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:15,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:15,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 80 [2019-11-16 00:07:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:07:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:15,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-16 00:07:15,262 INFO L567 ElimStorePlain]: treesize reduction 124, result has 33.3 percent of original size [2019-11-16 00:07:15,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:15,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:31 [2019-11-16 00:07:15,387 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 31 treesize of output 19 [2019-11-16 00:07:15,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:15,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:15,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-16 00:07:15,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:15,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:15,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:15,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-11-16 00:07:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-11-16 00:07:15,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:15,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2019-11-16 00:07:15,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523755255] [2019-11-16 00:07:15,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:07:15,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:15,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:07:15,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=592, Unknown=1, NotChecked=48, Total=702 [2019-11-16 00:07:15,465 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 27 states. [2019-11-16 00:07:19,707 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-16 00:07:23,750 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-16 00:07:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:27,047 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2019-11-16 00:07:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:07:27,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-16 00:07:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:27,049 INFO L225 Difference]: With dead ends: 146 [2019-11-16 00:07:27,049 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:07:27,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=174, Invalid=1308, Unknown=4, NotChecked=74, Total=1560 [2019-11-16 00:07:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:07:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2019-11-16 00:07:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:07:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-11-16 00:07:27,054 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 34 [2019-11-16 00:07:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:27,055 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-11-16 00:07:27,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:07:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-11-16 00:07:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:07:27,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:27,056 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:27,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:27,260 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:07:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1260425349, now seen corresponding path program 1 times [2019-11-16 00:07:27,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:27,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089297796] [2019-11-16 00:07:27,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:07:27,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089297796] [2019-11-16 00:07:27,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361210341] [2019-11-16 00:07:27,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:07:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:28,204 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:28,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-16 00:07:28,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762257046] [2019-11-16 00:07:28,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:07:28,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:07:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:07:28,206 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 23 states. [2019-11-16 00:07:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:29,467 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2019-11-16 00:07:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:07:29,467 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2019-11-16 00:07:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:29,468 INFO L225 Difference]: With dead ends: 147 [2019-11-16 00:07:29,469 INFO L226 Difference]: Without dead ends: 138 [2019-11-16 00:07:29,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:07:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-16 00:07:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2019-11-16 00:07:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:07:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2019-11-16 00:07:29,474 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 37 [2019-11-16 00:07:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:29,474 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2019-11-16 00:07:29,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:07:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2019-11-16 00:07:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:07:29,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:29,475 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:29,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:29,675 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:07:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -468940477, now seen corresponding path program 1 times [2019-11-16 00:07:29,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:29,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4428260] [2019-11-16 00:07:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:29,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:07:29,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4428260] [2019-11-16 00:07:29,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145151063] [2019-11-16 00:07:29,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:07:30,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:30,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:30,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-16 00:07:30,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640120035] [2019-11-16 00:07:30,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:30,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:30,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:30,029 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand 5 states. [2019-11-16 00:07:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:30,053 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2019-11-16 00:07:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:30,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-16 00:07:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:30,054 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:07:30,054 INFO L226 Difference]: Without dead ends: 120 [2019-11-16 00:07:30,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-16 00:07:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-16 00:07:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-16 00:07:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2019-11-16 00:07:30,058 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 43 [2019-11-16 00:07:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:30,059 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2019-11-16 00:07:30,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2019-11-16 00:07:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:07:30,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:30,059 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:30,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:30,264 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:07:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -60116252, now seen corresponding path program 1 times [2019-11-16 00:07:30,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:30,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697689794] [2019-11-16 00:07:30,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:07:30,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697689794] [2019-11-16 00:07:30,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869142518] [2019-11-16 00:07:30,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:07:30,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:30,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:07:30,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:07:30,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:07:30,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:07:30,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:07:30,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:07:30,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-16 00:07:32,934 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_16 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_10 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_16 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_16) v_entry_point_~c11~0.offset_BEFORE_CALL_10)))) is different from true [2019-11-16 00:07:32,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:07:32,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:32,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:32,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:07:32,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2019-11-16 00:07:36,971 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2019-11-16 00:07:37,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:37,011 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 19 treesize of output 18 [2019-11-16 00:07:37,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:37,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:37,029 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 19 treesize of output 18 [2019-11-16 00:07:37,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:37,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:26 [2019-11-16 00:07:37,127 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 25 treesize of output 17 [2019-11-16 00:07:37,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:37,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:07:37,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-16 00:07:37,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:37,247 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 33 treesize of output 28 [2019-11-16 00:07:37,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:37,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:37,249 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-16 00:07:37,257 INFO L567 ElimStorePlain]: treesize reduction 12, result has 45.5 percent of original size [2019-11-16 00:07:37,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2019-11-16 00:07:37,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:37,316 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:07:37,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:37,326 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:07:37,327 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-16 00:07:37,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-16 00:07:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2019-11-16 00:07:37,346 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:37,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 29 [2019-11-16 00:07:37,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610548436] [2019-11-16 00:07:37,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:07:37,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:37,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:07:37,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=740, Unknown=2, NotChecked=54, Total=870 [2019-11-16 00:07:37,347 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 30 states. [2019-11-16 00:07:49,787 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:07:55,881 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-11-16 00:07:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,752 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-11-16 00:07:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:07:59,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-11-16 00:07:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,753 INFO L225 Difference]: With dead ends: 133 [2019-11-16 00:07:59,754 INFO L226 Difference]: Without dead ends: 133 [2019-11-16 00:07:59,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=281, Invalid=2167, Unknown=6, NotChecked=96, Total=2550 [2019-11-16 00:07:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-16 00:07:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2019-11-16 00:07:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:07:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2019-11-16 00:07:59,758 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 43 [2019-11-16 00:07:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,759 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2019-11-16 00:07:59,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:07:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2019-11-16 00:07:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:07:59,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,759 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:59,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:59,960 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:07:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -60116251, now seen corresponding path program 1 times [2019-11-16 00:07:59,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56570357] [2019-11-16 00:07:59,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:08:00,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56570357] [2019-11-16 00:08:00,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956521301] [2019-11-16 00:08:00,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-16 00:08:00,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:00,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:00,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:00,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:08:00,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:00,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:00,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:00,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:08:00,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:00,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:00,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:00,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:00,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:00,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-16 00:08:02,946 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_19 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_19 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_19) v_entry_point_~c11~0.offset_BEFORE_CALL_12)))) is different from true [2019-11-16 00:08:06,977 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-16 00:08:06,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:06,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:07,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:07,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:22 [2019-11-16 00:08:11,059 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-16 00:08:11,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:11,087 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 19 treesize of output 18 [2019-11-16 00:08:11,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:11,103 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 19 treesize of output 18 [2019-11-16 00:08:11,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:58 [2019-11-16 00:08:11,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,336 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 88 treesize of output 59 [2019-11-16 00:08:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:11,337 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-16 00:08:11,354 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-16 00:08:11,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-16 00:08:11,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:14 [2019-11-16 00:08:11,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:11,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:11,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,476 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-16 00:08:11,482 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:11,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 33 [2019-11-16 00:08:11,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264468497] [2019-11-16 00:08:11,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:08:11,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:08:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=973, Unknown=3, NotChecked=62, Total=1122 [2019-11-16 00:08:11,483 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 34 states. [2019-11-16 00:08:33,903 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-16 00:08:39,957 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-16 00:08:46,027 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-16 00:08:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:53,791 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-16 00:08:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:08:53,791 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-11-16 00:08:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:53,792 INFO L225 Difference]: With dead ends: 122 [2019-11-16 00:08:53,792 INFO L226 Difference]: Without dead ends: 122 [2019-11-16 00:08:53,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=255, Invalid=2288, Unknown=11, NotChecked=98, Total=2652 [2019-11-16 00:08:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-16 00:08:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-11-16 00:08:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-16 00:08:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2019-11-16 00:08:53,797 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 43 [2019-11-16 00:08:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:53,797 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2019-11-16 00:08:53,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:08:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2019-11-16 00:08:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:08:53,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:53,798 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:54,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:54,004 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1763811589, now seen corresponding path program 1 times [2019-11-16 00:08:54,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:54,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772151545] [2019-11-16 00:08:54,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:08:54,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772151545] [2019-11-16 00:08:54,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:54,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:54,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722254065] [2019-11-16 00:08:54,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:54,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:54,101 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 7 states. [2019-11-16 00:08:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:54,293 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-16 00:08:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:08:54,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-16 00:08:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:54,294 INFO L225 Difference]: With dead ends: 118 [2019-11-16 00:08:54,294 INFO L226 Difference]: Without dead ends: 118 [2019-11-16 00:08:54,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-16 00:08:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-11-16 00:08:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-16 00:08:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-11-16 00:08:54,297 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 47 [2019-11-16 00:08:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:54,298 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-11-16 00:08:54,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-11-16 00:08:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:08:54,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:54,299 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:54,299 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1960325094, now seen corresponding path program 1 times [2019-11-16 00:08:54,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:54,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917632933] [2019-11-16 00:08:54,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:08:54,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917632933] [2019-11-16 00:08:54,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080044836] [2019-11-16 00:08:54,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-16 00:08:54,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:54,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:54,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:54,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-16 00:08:54,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:54,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:54,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:54,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:54,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:54,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:54,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:54,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:54,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:54,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:08:54,991 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:54,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2019-11-16 00:08:54,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333439478] [2019-11-16 00:08:54,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:08:54,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:08:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:08:54,993 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 20 states. [2019-11-16 00:08:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:55,951 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2019-11-16 00:08:55,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:08:55,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-11-16 00:08:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:55,955 INFO L225 Difference]: With dead ends: 136 [2019-11-16 00:08:55,955 INFO L226 Difference]: Without dead ends: 136 [2019-11-16 00:08:55,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:08:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-16 00:08:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2019-11-16 00:08:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:08:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-16 00:08:55,958 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 47 [2019-11-16 00:08:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:55,959 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-16 00:08:55,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:08:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-16 00:08:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:08:55,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:55,959 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:56,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:56,160 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1960325095, now seen corresponding path program 1 times [2019-11-16 00:08:56,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:56,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851234735] [2019-11-16 00:08:56,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:08:56,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851234735] [2019-11-16 00:08:56,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:56,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:08:56,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084978048] [2019-11-16 00:08:56,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:56,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:56,266 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-16 00:08:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:56,632 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-11-16 00:08:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:08:56,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-16 00:08:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:56,633 INFO L225 Difference]: With dead ends: 126 [2019-11-16 00:08:56,633 INFO L226 Difference]: Without dead ends: 126 [2019-11-16 00:08:56,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:08:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-16 00:08:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-16 00:08:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:08:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-16 00:08:56,637 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 47 [2019-11-16 00:08:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:56,637 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-16 00:08:56,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-16 00:08:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:08:56,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:56,639 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:56,639 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1821936750, now seen corresponding path program 1 times [2019-11-16 00:08:56,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:56,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067137526] [2019-11-16 00:08:56,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:08:57,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067137526] [2019-11-16 00:08:57,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828140360] [2019-11-16 00:08:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-16 00:08:57,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:57,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:57,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:57,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-16 00:08:57,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:57,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:57,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:57,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:57,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:57,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:57,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:57,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:57,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:57,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:08:57,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:08:57,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:57,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:57,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-16 00:08:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:08:57,528 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:57,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2019-11-16 00:08:57,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986076301] [2019-11-16 00:08:57,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:08:57,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:08:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:08:57,530 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 20 states. [2019-11-16 00:08:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:58,553 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2019-11-16 00:08:58,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:08:58,561 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2019-11-16 00:08:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:58,562 INFO L225 Difference]: With dead ends: 134 [2019-11-16 00:08:58,562 INFO L226 Difference]: Without dead ends: 134 [2019-11-16 00:08:58,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:08:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-16 00:08:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2019-11-16 00:08:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-16 00:08:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2019-11-16 00:08:58,566 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 48 [2019-11-16 00:08:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:58,566 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2019-11-16 00:08:58,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:08:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2019-11-16 00:08:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:08:58,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:58,567 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:58,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:58,768 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1821936751, now seen corresponding path program 1 times [2019-11-16 00:08:58,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:58,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629500664] [2019-11-16 00:08:58,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:58,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:58,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:08:58,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629500664] [2019-11-16 00:08:58,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:58,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:08:58,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435895235] [2019-11-16 00:08:58,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:08:58,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:08:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:58,905 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 11 states. [2019-11-16 00:08:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:59,327 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2019-11-16 00:08:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:08:59,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-16 00:08:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:59,328 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:08:59,328 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:08:59,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:08:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:08:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-16 00:08:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-16 00:08:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-11-16 00:08:59,332 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 48 [2019-11-16 00:08:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:59,332 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-11-16 00:08:59,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:08:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-11-16 00:08:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:08:59,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:59,334 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:59,334 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2134526587, now seen corresponding path program 1 times [2019-11-16 00:08:59,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:59,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585757536] [2019-11-16 00:08:59,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:08:59,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585757536] [2019-11-16 00:08:59,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:59,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:08:59,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151670983] [2019-11-16 00:08:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:08:59,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:08:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:08:59,507 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 9 states. [2019-11-16 00:08:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:59,890 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-11-16 00:08:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:08:59,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-16 00:08:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:59,891 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:08:59,891 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:08:59,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:08:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:08:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-11-16 00:08:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:08:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-11-16 00:08:59,893 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 63 [2019-11-16 00:08:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:59,893 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-11-16 00:08:59,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:08:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-11-16 00:08:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:08:59,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:59,894 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:59,895 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:08:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2012763628, now seen corresponding path program 1 times [2019-11-16 00:08:59,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:59,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144891218] [2019-11-16 00:08:59,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:09:00,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144891218] [2019-11-16 00:09:00,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:00,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-16 00:09:00,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824808579] [2019-11-16 00:09:00,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:09:00,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:09:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:09:00,170 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 17 states. [2019-11-16 00:09:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:00,906 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2019-11-16 00:09:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:09:00,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-11-16 00:09:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:00,907 INFO L225 Difference]: With dead ends: 150 [2019-11-16 00:09:00,907 INFO L226 Difference]: Without dead ends: 150 [2019-11-16 00:09:00,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:09:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-16 00:09:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2019-11-16 00:09:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:09:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2019-11-16 00:09:00,911 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 62 [2019-11-16 00:09:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:00,912 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2019-11-16 00:09:00,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:09:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2019-11-16 00:09:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:09:00,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:00,913 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:00,913 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2012763627, now seen corresponding path program 1 times [2019-11-16 00:09:00,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:00,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493175929] [2019-11-16 00:09:00,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:00,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:01,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493175929] [2019-11-16 00:09:01,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858259165] [2019-11-16 00:09:01,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:01,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-16 00:09:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:09:01,784 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:01,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 25 [2019-11-16 00:09:01,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527399312] [2019-11-16 00:09:01,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:09:01,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:09:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:09:01,786 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 26 states. [2019-11-16 00:09:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:03,152 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-11-16 00:09:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:09:03,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2019-11-16 00:09:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:03,153 INFO L225 Difference]: With dead ends: 135 [2019-11-16 00:09:03,153 INFO L226 Difference]: Without dead ends: 135 [2019-11-16 00:09:03,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=1931, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:09:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-16 00:09:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2019-11-16 00:09:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-16 00:09:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2019-11-16 00:09:03,158 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 62 [2019-11-16 00:09:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:03,158 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2019-11-16 00:09:03,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:09:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2019-11-16 00:09:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:09:03,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:03,159 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:03,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:03,373 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2103506780, now seen corresponding path program 1 times [2019-11-16 00:09:03,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:03,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107775759] [2019-11-16 00:09:03,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:03,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:03,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:09:03,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107775759] [2019-11-16 00:09:03,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:03,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-16 00:09:03,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976903801] [2019-11-16 00:09:03,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:09:03,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:03,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:09:03,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:09:03,681 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 19 states. [2019-11-16 00:09:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:04,720 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-16 00:09:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:09:04,720 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2019-11-16 00:09:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:04,721 INFO L225 Difference]: With dead ends: 133 [2019-11-16 00:09:04,721 INFO L226 Difference]: Without dead ends: 133 [2019-11-16 00:09:04,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:09:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-16 00:09:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2019-11-16 00:09:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:09:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2019-11-16 00:09:04,725 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 63 [2019-11-16 00:09:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:04,725 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2019-11-16 00:09:04,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:09:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2019-11-16 00:09:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:09:04,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:04,726 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:04,726 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -862010797, now seen corresponding path program 1 times [2019-11-16 00:09:04,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:04,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075091034] [2019-11-16 00:09:04,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:04,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:04,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:05,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075091034] [2019-11-16 00:09:05,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046761364] [2019-11-16 00:09:05,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-16 00:09:05,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:05,780 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 13 treesize of output 9 [2019-11-16 00:09:05,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:05,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:05,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:05,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:09:06,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:06,334 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2019-11-16 00:09:06,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:06,338 INFO L567 ElimStorePlain]: treesize reduction 17, result has 15.0 percent of original size [2019-11-16 00:09:06,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:06,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-16 00:09:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:09:06,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:09:06,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [25] total 39 [2019-11-16 00:09:06,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846655500] [2019-11-16 00:09:06,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:09:06,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:09:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:09:06,347 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 20 states. [2019-11-16 00:09:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:07,233 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-11-16 00:09:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:09:07,234 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-11-16 00:09:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:07,234 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:09:07,235 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:09:07,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2019-11-16 00:09:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:09:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-16 00:09:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:09:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-11-16 00:09:07,239 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 71 [2019-11-16 00:09:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:07,239 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-11-16 00:09:07,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:09:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-11-16 00:09:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:09:07,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:07,240 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:07,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:07,444 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash -952530537, now seen corresponding path program 1 times [2019-11-16 00:09:07,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:07,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341941057] [2019-11-16 00:09:07,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:07,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:07,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:08,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341941057] [2019-11-16 00:09:08,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183875525] [2019-11-16 00:09:08,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:08,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-16 00:09:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:08,650 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 13 treesize of output 9 [2019-11-16 00:09:08,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:08,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:08,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:08,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:09:09,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:09,138 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-16 00:09:09,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:09,142 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-11-16 00:09:09,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:09,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:09:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:09,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:09,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 40 [2019-11-16 00:09:09,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000909382] [2019-11-16 00:09:09,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:09:09,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:09:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:09:09,153 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 40 states. [2019-11-16 00:09:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:11,004 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-11-16 00:09:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:09:11,005 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 72 [2019-11-16 00:09:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:11,005 INFO L225 Difference]: With dead ends: 104 [2019-11-16 00:09:11,005 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:09:11,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=366, Invalid=4056, Unknown=0, NotChecked=0, Total=4422 [2019-11-16 00:09:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:09:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-16 00:09:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-16 00:09:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-11-16 00:09:11,009 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 72 [2019-11-16 00:09:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:11,009 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-11-16 00:09:11,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:09:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-11-16 00:09:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:09:11,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:11,010 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:11,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:11,213 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 536575749, now seen corresponding path program 1 times [2019-11-16 00:09:11,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:11,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893134329] [2019-11-16 00:09:11,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:11,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:11,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893134329] [2019-11-16 00:09:11,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253400888] [2019-11-16 00:09:11,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:09:11,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:11,546 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:11,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-16 00:09:11,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171346987] [2019-11-16 00:09:11,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:09:11,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:09:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:11,548 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 10 states. [2019-11-16 00:09:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:11,827 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-11-16 00:09:11,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:09:11,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-11-16 00:09:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:11,828 INFO L225 Difference]: With dead ends: 102 [2019-11-16 00:09:11,828 INFO L226 Difference]: Without dead ends: 102 [2019-11-16 00:09:11,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:09:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-16 00:09:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-16 00:09:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-16 00:09:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-11-16 00:09:11,831 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 73 [2019-11-16 00:09:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:11,831 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-11-16 00:09:11,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:09:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-11-16 00:09:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:09:11,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:11,832 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:12,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:12,033 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash -546020522, now seen corresponding path program 1 times [2019-11-16 00:09:12,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:12,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390481345] [2019-11-16 00:09:12,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:12,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:12,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:12,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390481345] [2019-11-16 00:09:12,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563319097] [2019-11-16 00:09:12,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:12,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:09:12,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:09:12,426 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:12,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-16 00:09:12,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63038083] [2019-11-16 00:09:12,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:09:12,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:09:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:12,428 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 10 states. [2019-11-16 00:09:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:12,862 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-11-16 00:09:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:12,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-11-16 00:09:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:12,863 INFO L225 Difference]: With dead ends: 101 [2019-11-16 00:09:12,864 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:09:12,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:09:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-16 00:09:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:09:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-11-16 00:09:12,866 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 74 [2019-11-16 00:09:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:12,867 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-11-16 00:09:12,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:09:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-11-16 00:09:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:09:12,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:12,868 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:13,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:13,068 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash 253233447, now seen corresponding path program 1 times [2019-11-16 00:09:13,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:13,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556177956] [2019-11-16 00:09:13,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:09:13,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556177956] [2019-11-16 00:09:13,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225264145] [2019-11-16 00:09:13,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:09:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:13,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:13,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:13,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:09:13,473 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:13,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 9 [2019-11-16 00:09:13,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265537531] [2019-11-16 00:09:13,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:09:13,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:09:13,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:13,478 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 10 states. [2019-11-16 00:09:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:13,908 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-11-16 00:09:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:13,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-11-16 00:09:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:13,910 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:09:13,910 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:09:13,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:09:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-16 00:09:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:09:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-11-16 00:09:13,913 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 75 [2019-11-16 00:09:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-11-16 00:09:13,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:09:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-11-16 00:09:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:09:13,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:13,914 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:14,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:14,114 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1906011937, now seen corresponding path program 1 times [2019-11-16 00:09:14,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:14,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145593015] [2019-11-16 00:09:14,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:09:14,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145593015] [2019-11-16 00:09:14,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189662393] [2019-11-16 00:09:14,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:09:14,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:14,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:14,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:14,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:14,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:14,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:14,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:14,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:14,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:14,592 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-16 00:09:14,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:14,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:14,631 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:09:14,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:14,641 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:09:14,642 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-16 00:09:14,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-16 00:09:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:09:14,652 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:14,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2019-11-16 00:09:14,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345740894] [2019-11-16 00:09:14,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:09:14,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:14,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:09:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:09:14,653 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 14 states. [2019-11-16 00:09:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:15,167 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-11-16 00:09:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:09:15,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-11-16 00:09:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:15,168 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:09:15,168 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:09:15,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:09:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:09:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-16 00:09:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-16 00:09:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-11-16 00:09:15,171 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 76 [2019-11-16 00:09:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:15,171 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-11-16 00:09:15,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:09:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-11-16 00:09:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:09:15,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:15,172 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:15,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:15,373 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2115492731, now seen corresponding path program 1 times [2019-11-16 00:09:15,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810083009] [2019-11-16 00:09:15,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:09:15,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810083009] [2019-11-16 00:09:15,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693761092] [2019-11-16 00:09:15,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:09:15,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:15,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:15,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:15,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:15,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:15,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:15,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:15,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:09:15,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:15,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:15,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:15,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:09:15,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:09:15,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:15,868 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-16 00:09:15,868 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-16 00:09:15,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-16 00:09:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:09:15,902 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:15,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2019-11-16 00:09:15,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419349642] [2019-11-16 00:09:15,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:09:15,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:09:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:09:15,903 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 15 states. [2019-11-16 00:09:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:16,460 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-11-16 00:09:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:09:16,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-11-16 00:09:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:16,461 INFO L225 Difference]: With dead ends: 108 [2019-11-16 00:09:16,461 INFO L226 Difference]: Without dead ends: 108 [2019-11-16 00:09:16,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:09:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-16 00:09:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-16 00:09:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-16 00:09:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-11-16 00:09:16,464 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 78 [2019-11-16 00:09:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:16,464 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-11-16 00:09:16,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:09:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-11-16 00:09:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:09:16,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:16,465 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:16,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:16,669 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1761450179, now seen corresponding path program 1 times [2019-11-16 00:09:16,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918452413] [2019-11-16 00:09:16,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:09:17,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918452413] [2019-11-16 00:09:17,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551430469] [2019-11-16 00:09:17,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:17,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:09:17,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:17,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:17,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:17,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:17,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:17,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:17,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:17,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:09:17,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:17,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:17,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:17,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:09:17,874 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-16 00:09:17,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:17,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:17,877 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-16 00:09:17,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-16 00:09:17,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:17,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:09:17,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:18,008 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-16 00:09:18,009 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-16 00:09:18,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2019-11-16 00:09:18,055 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:18,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:09:18,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:18,086 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-16 00:09:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:18,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:18,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-11-16 00:09:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:09:18,291 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:18,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13] total 34 [2019-11-16 00:09:18,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387546035] [2019-11-16 00:09:18,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-16 00:09:18,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-16 00:09:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:09:18,293 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 35 states. [2019-11-16 00:09:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:19,700 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-11-16 00:09:19,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:09:19,701 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 79 [2019-11-16 00:09:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:19,701 INFO L225 Difference]: With dead ends: 107 [2019-11-16 00:09:19,701 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:09:19,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=361, Invalid=2609, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:09:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:09:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2019-11-16 00:09:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-16 00:09:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-11-16 00:09:19,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 79 [2019-11-16 00:09:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:19,705 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-11-16 00:09:19,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-16 00:09:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-11-16 00:09:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:09:19,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:19,706 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:19,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:19,910 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1705700402, now seen corresponding path program 1 times [2019-11-16 00:09:19,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:19,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764494523] [2019-11-16 00:09:19,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:19,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:19,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:09:20,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764494523] [2019-11-16 00:09:20,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045620442] [2019-11-16 00:09:20,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-16 00:09:20,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:20,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:20,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:20,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:09:20,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:09:20,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:09:20,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2019-11-16 00:09:20,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-16 00:09:20,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,661 INFO L567 ElimStorePlain]: treesize reduction 18, result has 45.5 percent of original size [2019-11-16 00:09:20,662 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-16 00:09:20,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-16 00:09:20,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:20,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-16 00:09:20,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:20,754 INFO L567 ElimStorePlain]: treesize reduction 28, result has 36.4 percent of original size [2019-11-16 00:09:20,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:20,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2019-11-16 00:09:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:09:20,806 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:20,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 27 [2019-11-16 00:09:20,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428698185] [2019-11-16 00:09:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:09:20,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:09:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:09:20,807 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 28 states. [2019-11-16 00:09:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:22,220 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-11-16 00:09:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:09:22,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2019-11-16 00:09:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:22,221 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:09:22,221 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:09:22,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=2518, Unknown=0, NotChecked=0, Total=2862 [2019-11-16 00:09:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:09:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2019-11-16 00:09:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:09:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-11-16 00:09:22,224 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 81 [2019-11-16 00:09:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:22,224 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-11-16 00:09:22,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:09:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-11-16 00:09:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:09:22,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:22,225 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:22,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:22,428 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:09:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:22,429 INFO L82 PathProgramCache]: Analyzing trace with hash -762137940, now seen corresponding path program 1 times [2019-11-16 00:09:22,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:22,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147592548] [2019-11-16 00:09:22,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:22,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:22,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:09:23,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147592548] [2019-11-16 00:09:23,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774323121] [2019-11-16 00:09:23,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-16 00:09:23,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:23,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-16 00:09:23,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-16 00:09:23,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:23,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 1 [2019-11-16 00:09:23,536 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-16 00:09:23,542 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-16 00:09:23,585 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:124 [2019-11-16 00:09:23,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2019-11-16 00:09:23,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2019-11-16 00:09:23,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2019-11-16 00:09:23,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:23,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:23,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-16 00:09:23,766 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:74 [2019-11-16 00:09:51,883 WARN L191 SmtUtils]: Spent 20.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-16 00:09:51,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:13,960 WARN L191 SmtUtils]: Spent 20.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-16 00:10:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:10:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:14,080 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 146 [2019-11-16 00:10:14,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:14,185 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 146 [2019-11-16 00:10:14,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:14,286 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 146 [2019-11-16 00:10:14,286 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:14,389 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 138 [2019-11-16 00:10:14,390 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:14,492 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 138 [2019-11-16 00:10:14,493 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:14,582 INFO L341 Elim1Store]: treesize reduction 35, result has 70.1 percent of original size [2019-11-16 00:10:14,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 138 [2019-11-16 00:10:14,583 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:15,091 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-16 00:10:15,091 INFO L567 ElimStorePlain]: treesize reduction 270, result has 64.0 percent of original size [2019-11-16 00:10:15,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2019-11-16 00:10:15,092 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:427, output treesize:481 [2019-11-16 00:10:43,392 WARN L191 SmtUtils]: Spent 28.24 s on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-11-16 00:10:43,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:10:43,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2019-11-16 00:10:43,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:43,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2019-11-16 00:10:43,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:43,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2019-11-16 00:10:43,561 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:43,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:43,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-16 00:10:43,660 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:226, output treesize:214 [2019-11-16 00:10:49,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2019-11-16 00:10:49,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:50,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:50,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2019-11-16 00:10:50,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:50,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:50,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2019-11-16 00:10:50,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:50,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:50,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-16 00:10:50,244 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:214, output treesize:172 [2019-11-16 00:10:52,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:10:52,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2019-11-16 00:10:52,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2019-11-16 00:10:52,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2019-11-16 00:10:52,480 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,619 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-16 00:10:52,619 INFO L567 ElimStorePlain]: treesize reduction 24, result has 86.0 percent of original size [2019-11-16 00:10:52,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-16 00:10:52,620 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:190, output treesize:148 [2019-11-16 00:10:52,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:10:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:52,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:52,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 85 [2019-11-16 00:10:52,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:52,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 85 [2019-11-16 00:10:52,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,039 INFO L567 ElimStorePlain]: treesize reduction 44, result has 67.9 percent of original size [2019-11-16 00:10:53,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-16 00:10:53,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:93 [2019-11-16 00:10:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:53,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:53,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:10:53,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,391 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2019-11-16 00:10:53,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:53,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:51 [2019-11-16 00:10:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 2 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:10:53,531 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:53,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 38 [2019-11-16 00:10:53,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309500795] [2019-11-16 00:10:53,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-16 00:10:53,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:53,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:10:53,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1361, Unknown=9, NotChecked=0, Total=1482 [2019-11-16 00:10:53,532 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 39 states. [2019-11-16 00:11:21,609 WARN L191 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-16 00:11:43,714 WARN L191 SmtUtils]: Spent 20.05 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:11:43,932 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-16 00:11:44,124 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-16 00:11:44,390 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:11:49,527 WARN L191 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-11-16 00:11:57,138 WARN L191 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-16 00:12:21,842 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-16 00:13:02,558 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-11-16 00:13:02,771 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-11-16 00:13:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:13,241 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-11-16 00:13:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:13:13,242 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 84 [2019-11-16 00:13:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:13,242 INFO L225 Difference]: With dead ends: 112 [2019-11-16 00:13:13,242 INFO L226 Difference]: Without dead ends: 82 [2019-11-16 00:13:13,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 148.3s TimeCoverageRelationStatistics Valid=295, Invalid=3592, Unknown=19, NotChecked=0, Total=3906 [2019-11-16 00:13:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-16 00:13:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-16 00:13:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:13:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-11-16 00:13:13,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 84 [2019-11-16 00:13:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:13,246 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-11-16 00:13:13,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-16 00:13:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-11-16 00:13:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:13:13,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:13,247 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:13,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:13,448 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION]=== [2019-11-16 00:13:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash 406280692, now seen corresponding path program 1 times [2019-11-16 00:13:13,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:13,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110184793] [2019-11-16 00:13:13,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:13,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:13,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:13:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:13:13,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:13:13,524 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:13:13,560 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-16 00:13:13,571 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-16 00:13:13,572 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-16 00:13:13,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:13:13 BoogieIcfgContainer [2019-11-16 00:13:13,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:13:13,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:13:13,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:13:13,610 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:13:13,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:41" (3/4) ... [2019-11-16 00:13:13,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:13:13,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:13:13,615 INFO L168 Benchmark]: Toolchain (without parser) took 393940.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -228.9 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:13,616 INFO L168 Benchmark]: CDTParser took 0.20 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-16 00:13:13,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:13,616 INFO L168 Benchmark]: Boogie Preprocessor took 143.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:13,617 INFO L168 Benchmark]: RCFGBuilder took 1193.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:13,617 INFO L168 Benchmark]: TraceAbstraction took 391928.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 973.6 MB in the beginning and 1.2 GB in the end (delta: -194.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:13:13,617 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:13:13,623 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.20 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 665.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1193.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 391928.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 973.6 MB in the beginning and 1.2 GB in the end (delta: -194.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 823. Possible FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-8:0}] [L824] CALL entry_point() VAL [ldv_global_msg_list={-8:0}] [L803] CALL, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [\old(size)=20, ldv_global_msg_list={-8:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=20, \result={-6:0}, ldv_global_msg_list={-8:0}, malloc(size)={-6:0}, size=20] [L803] RET, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [ldv_global_msg_list={-8:0}, ldv_malloc(sizeof(struct ldv_i2c_client))={-6:0}] [L803] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L804] COND FALSE !(!c11) VAL [c11={-6:0}, ldv_global_msg_list={-8:0}] [L806] CALL, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [\old(size)=4, ldv_global_msg_list={-8:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=4, \result={-4:0}, ldv_global_msg_list={-8:0}, malloc(size)={-4:0}, size=4] [L806] RET, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [c11={-6:0}, ldv_global_msg_list={-8:0}, ldv_malloc(sizeof(struct ldv_m88ts2022_config))={-4:0}] [L805-L806] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L807] COND FALSE !(!cfg) VAL [c11={-6:0}, cfg={-4:0}, ldv_global_msg_list={-8:0}] [L808] c11->dev.platform_data = cfg VAL [c11={-6:0}, cfg={-4:0}, ldv_global_msg_list={-8:0}] [L810] CALL, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [\old(size)=4, ldv_global_msg_list={-8:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=4, \result={-5:0}, ldv_global_msg_list={-8:0}, malloc(size)={-5:0}, size=4] [L810] RET, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [c11={-6:0}, cfg={-4:0}, ldv_global_msg_list={-8:0}, ldv_malloc(sizeof(struct ldv_dvb_frontend))={-5:0}] [L809-L810] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L811] COND FALSE !(!fe) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L812] cfg->fe = fe VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L813] CALL alloc_3_11(c11) VAL [client={-6:0}, ldv_global_msg_list={-8:0}] [L785] EXPR client->dev.platform_data VAL [client={-6:0}, client={-6:0}, client->dev.platform_data={-4:0}, ldv_global_msg_list={-8:0}] [L785] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L786] EXPR cfg->fe VAL [cfg={-4:0}, cfg->fe={-5:0}, client={-6:0}, client={-6:0}, ldv_global_msg_list={-8:0}] [L786] struct ldv_dvb_frontend *fe = cfg->fe; [L787] CALL, EXPR ldv_malloc(sizeof(struct Data11)) VAL [\old(size)=12, ldv_global_msg_list={-8:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=12, \result={2:0}, ldv_global_msg_list={-8:0}, malloc(size)={2:0}, size=12] [L787] RET, EXPR ldv_malloc(sizeof(struct Data11)) VAL [cfg={-4:0}, client={-6:0}, client={-6:0}, fe={-5:0}, ldv_global_msg_list={-8:0}, ldv_malloc(sizeof(struct Data11))={2:0}] [L787] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L788] COND FALSE !(!priv) VAL [cfg={-4:0}, client={-6:0}, client={-6:0}, fe={-5:0}, ldv_global_msg_list={-8:0}, priv={2:0}] [L789] fe->tuner_priv = priv VAL [cfg={-4:0}, client={-6:0}, client={-6:0}, fe={-5:0}, ldv_global_msg_list={-8:0}, priv={2:0}] [L790] CALL ldv_i2c_set_clientdata(client, 0) VAL [data={0:0}, dev={-6:0}, ldv_global_msg_list={-8:0}] [L779] CALL ldv_dev_set_drvdata(&dev->dev, data) VAL [data={0:0}, dev={-6:0}, ldv_global_msg_list={-8:0}] [L624] dev->driver_data = data VAL [data={0:0}, data={0:0}, dev={-6:0}, dev={-6:0}, ldv_global_msg_list={-8:0}] [L779] RET ldv_dev_set_drvdata(&dev->dev, data) VAL [data={0:0}, data={0:0}, dev={-6:0}, dev={-6:0}, ldv_global_msg_list={-8:0}] [L790] RET ldv_i2c_set_clientdata(client, 0) VAL [cfg={-4:0}, client={-6:0}, client={-6:0}, fe={-5:0}, ldv_global_msg_list={-8:0}, priv={2:0}] [L791] return 0; VAL [\result=0, cfg={-4:0}, client={-6:0}, client={-6:0}, fe={-5:0}, ldv_global_msg_list={-8:0}, priv={2:0}] [L813] RET alloc_3_11(c11) VAL [alloc_3_11(c11)=0, c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L814] CALL free_11(c11) VAL [client={-6:0}, ldv_global_msg_list={-8:0}] [L797] CALL, EXPR ldv_i2c_get_clientdata(client) VAL [dev={-6:0}, ldv_global_msg_list={-8:0}] [L775] CALL, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-6:0}, ldv_global_msg_list={-8:0}] [L620] EXPR dev->driver_data VAL [dev={-6:0}, dev={-6:0}, dev->driver_data={0:0}, ldv_global_msg_list={-8:0}] [L620] return dev->driver_data; [L775] RET, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-6:0}, dev={-6:0}, ldv_dev_get_drvdata(&dev->dev)={0:0}, ldv_global_msg_list={-8:0}] [L775] return ldv_dev_get_drvdata(&dev->dev); [L797] RET, EXPR ldv_i2c_get_clientdata(client) VAL [client={-6:0}, client={-6:0}, ldv_global_msg_list={-8:0}, ldv_i2c_get_clientdata(client)={0:0}] [L797] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L798] COND FALSE !(\read(*priv)) VAL [client={-6:0}, client={-6:0}, ldv_global_msg_list={-8:0}, priv={0:0}] [L814] RET free_11(c11) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L815] free(fe) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L815] free(fe) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L815] free(fe) [L817] free(cfg) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L817] free(cfg) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L817] free(cfg) [L819] free(c11) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L819] free(c11) VAL [c11={-6:0}, cfg={-4:0}, fe={-5:0}, ldv_global_msg_list={-8:0}] [L819] free(c11) [L824] RET entry_point() VAL [ldv_global_msg_list={-8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 50 procedures, 400 locations, 93 error locations. Result: UNSAFE, OverallTime: 391.8s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 252.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3182 SDtfs, 4674 SDslu, 11893 SDs, 0 SdLazy, 29710 SolverSat, 2191 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 119.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2624 GetRequests, 1676 SyntacticMatches, 39 SemanticMatches, 909 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5945 ImplicationChecksByTransitivity, 249.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred 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, 39 MinimizatonAttempts, 755 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 126.6s InterpolantComputationTime, 3341 NumberOfCodeBlocks, 3341 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 3188 ConstructedInterpolants, 151 QuantifiedInterpolants, 1167914 SizeOfPredicates, 216 NumberOfNonLiveVariables, 7735 ConjunctsInSsa, 980 ConjunctsInUnsatCore, 68 InterpolantComputations, 15 PerfectInterpolantSequences, 881/1172 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 could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:13:15,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:13:15,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:13:15,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:13:15,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:13:15,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:13:15,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:13:15,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:13:15,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:13:15,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:13:15,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:13:15,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:13:15,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:13:15,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:13:15,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:13:15,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:13:15,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:13:15,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:13:15,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:13:15,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:13:15,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:13:15,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:13:15,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:13:15,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:13:15,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:13:15,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:13:15,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:13:15,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:13:15,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:13:15,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:13:15,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:13:15,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:13:15,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:13:15,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:13:15,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:13:15,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:13:15,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:13:15,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:13:15,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:13:15,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:13:15,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:13:15,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:13:15,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:13:15,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:13:15,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:13:15,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:13:15,975 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:13:15,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:13:15,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:13:15,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:13:15,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:13:15,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:13:15,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:13:15,978 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:13:15,978 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:13:15,978 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:13:15,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:13:15,979 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:13:15,979 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:13:15,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:13:15,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:13:15,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:13:15,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:13:15,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:13:15,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:13:15,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:13:15,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:13:15,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:13:15,982 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:13:15,982 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:13:15,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:13:15,982 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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 -> 238bdb5f7d99ba2e1fec6ce0d5e4dc0227502909 [2019-11-16 00:13:16,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:13:16,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:13:16,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:13:16,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:13:16,051 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:13:16,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2019-11-16 00:13:16,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/31ada8f8e/2bc1ed93384a4c06aa7f92b18b577e27/FLAGd9b10cd3b [2019-11-16 00:13:16,635 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:13:16,636 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2019-11-16 00:13:16,651 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/31ada8f8e/2bc1ed93384a4c06aa7f92b18b577e27/FLAGd9b10cd3b [2019-11-16 00:13:16,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/data/31ada8f8e/2bc1ed93384a4c06aa7f92b18b577e27 [2019-11-16 00:13:16,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:13:16,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:13:16,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:13:16,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:13:16,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:13:16,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:16" (1/1) ... [2019-11-16 00:13:16,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2f1957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:16, skipping insertion in model container [2019-11-16 00:13:16,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:16" (1/1) ... [2019-11-16 00:13:16,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:13:16,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:13:17,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:13:17,525 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:13:17,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:13:17,673 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:13:17,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17 WrapperNode [2019-11-16 00:13:17,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:13:17,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:13:17,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:13:17,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:13:17,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... [2019-11-16 00:13:17,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:13:17,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:13:17,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:13:17,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:13:17,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/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-16 00:13:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:13:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:13:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-16 00:13:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-16 00:13:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-16 00:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-16 00:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-16 00:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-16 00:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-16 00:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-16 00:13:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-16 00:13:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-16 00:13:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-16 00:13:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-16 00:13:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-16 00:13:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-16 00:13:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-16 00:13:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-16 00:13:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-16 00:13:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-16 00:13:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-16 00:13:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2019-11-16 00:13:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_3_11 [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-16 00:13:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-16 00:13:17,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-16 00:13:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:13:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:13:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:13:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:13:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:13:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:13:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:13:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:13:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:13:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:13:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:13:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:13:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:13:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:13:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:13:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:13:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:13:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:13:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:13:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:13:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:13:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:13:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:13:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:13:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:13:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:13:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:13:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:13:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:13:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:13:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:13:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:13:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:13:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:13:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:13:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-16 00:13:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:13:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-16 00:13:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-16 00:13:17,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2019-11-16 00:13:17,906 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_3_11 [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-16 00:13:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-16 00:13:18,532 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:13:18,986 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:13:19,520 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:13:19,520 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-16 00:13:19,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:19 BoogieIcfgContainer [2019-11-16 00:13:19,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:13:19,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:13:19,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:13:19,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:13:19,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:13:16" (1/3) ... [2019-11-16 00:13:19,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2291d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:19, skipping insertion in model container [2019-11-16 00:13:19,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:17" (2/3) ... [2019-11-16 00:13:19,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2291d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:19, skipping insertion in model container [2019-11-16 00:13:19,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:19" (3/3) ... [2019-11-16 00:13:19,531 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2019-11-16 00:13:19,540 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:13:19,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 93 error locations. [2019-11-16 00:13:19,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 93 error locations. [2019-11-16 00:13:19,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:13:19,580 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:13:19,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:13:19,581 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:13:19,581 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:13:19,581 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:13:19,581 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:13:19,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:13:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2019-11-16 00:13:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:13:19,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:19,619 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:19,623 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_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_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, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, 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_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, alloc_3_11Err0REQUIRES_VIOLATION, alloc_3_11Err1REQUIRES_VIOLATION, alloc_3_11Err2REQUIRES_VIOLATION, alloc_3_11Err3REQUIRES_VIOLATION, alloc_3_11Err4REQUIRES_VIOLATION, alloc_3_11Err5REQUIRES_VIOLATION]=== [2019-11-16 00:13:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1172166147, now seen corresponding path program 1 times [2019-11-16 00:13:19,640 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:13:19,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [632201739] [2019-11-16 00:13:19,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ec460c2-9b78-47c3-ba26-11565bce2641/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:13:19,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:13:19,878 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:13:19,884 INFO L168 Benchmark]: Toolchain (without parser) took 2951.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 947.0 MB in the beginning and 975.2 MB in the end (delta: -28.2 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:19,884 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:13:19,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:19,888 INFO L168 Benchmark]: Boogie Preprocessor took 138.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:19,889 INFO L168 Benchmark]: RCFGBuilder took 1701.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:19,891 INFO L168 Benchmark]: TraceAbstraction took 358.01 ms. Allocated memory is still 1.2 GB. Free memory was 993.6 MB in the beginning and 975.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:13:19,895 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 741.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1701.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 358.01 ms. Allocated memory is still 1.2 GB. Free memory was 993.6 MB in the beginning and 975.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...