./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 708e975f6ded0cfba15d7fd51cdde51c174d1f46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 708e975f6ded0cfba15d7fd51cdde51c174d1f46 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:57:56,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:57:56,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:57:56,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:57:56,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:57:56,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:57:56,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:57:56,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:57:56,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:57:56,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:57:56,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:57:57,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:57:57,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:57:57,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:57:57,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:57:57,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:57:57,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:57:57,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:57:57,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:57:57,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:57:57,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:57:57,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:57:57,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:57:57,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:57:57,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:57:57,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:57:57,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:57:57,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:57:57,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:57:57,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:57:57,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:57:57,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:57:57,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:57:57,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:57:57,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:57:57,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:57:57,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:57:57,041 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:57:57,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:57:57,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:57:57,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:57:57,043 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:57:57,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:57:57,044 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:57:57,045 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:57:57,045 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:57:57,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:57:57,045 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:57:57,045 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:57:57,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:57:57,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:57:57,047 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:57:57,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:57:57,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:57:57,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:57:57,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:57:57,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:57:57,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:57:57,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 708e975f6ded0cfba15d7fd51cdde51c174d1f46 [2019-01-13 22:57:57,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:57:57,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:57:57,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:57:57,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:57:57,120 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:57:57,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2019-01-13 22:57:57,184 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0cd8573/453ce1f5929245cda00c7d73070915a2/FLAG91d9de03e [2019-01-13 22:57:57,662 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:57:57,663 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2019-01-13 22:57:57,680 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0cd8573/453ce1f5929245cda00c7d73070915a2/FLAG91d9de03e [2019-01-13 22:57:57,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0cd8573/453ce1f5929245cda00c7d73070915a2 [2019-01-13 22:57:57,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:57:57,955 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:57:57,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:57:57,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:57:57,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:57:57,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:57:57" (1/1) ... [2019-01-13 22:57:57,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c1e4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:57, skipping insertion in model container [2019-01-13 22:57:57,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:57:57" (1/1) ... [2019-01-13 22:57:57,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:57:58,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:57:58,426 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:57:58,448 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:57:58,600 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:57:58,680 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:57:58,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58 WrapperNode [2019-01-13 22:57:58,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:57:58,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:57:58,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:57:58,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:57:58,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... [2019-01-13 22:57:58,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:57:58,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:57:58,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:57:58,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:57:58,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:57:58,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-13 22:57:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-13 22:57:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-13 22:57:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-13 22:57:58,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-13 22:57:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-13 22:57:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-13 22:57:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-13 22:57:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-13 22:57:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-13 22:57:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-13 22:57:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-13 22:57:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-13 22:57:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 22:57:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 22:57:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:57:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:57:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:57:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:57:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:57:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:57:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:57:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:57:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:57:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:57:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:57:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:57:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:57:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:57:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:57:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:57:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:57:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:57:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:57:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:57:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:57:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:57:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:57:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:57:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:57:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:57:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:57:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:57:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:57:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:57:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:57:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-13 22:57:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:57:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-13 22:57:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-13 22:57:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-13 22:57:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-13 22:57:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-13 22:57:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-13 22:57:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:57:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-13 22:57:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-13 22:57:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-13 22:57:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 22:57:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-13 22:57:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-13 22:57:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:57:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:57:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:57:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:57:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-13 22:57:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-13 22:57:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-13 22:57:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-13 22:57:59,607 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 22:58:00,335 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 22:58:01,184 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:58:01,184 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-13 22:58:01,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:58:01 BoogieIcfgContainer [2019-01-13 22:58:01,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:58:01,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:58:01,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:58:01,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:58:01,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:57:57" (1/3) ... [2019-01-13 22:58:01,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e0adad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:58:01, skipping insertion in model container [2019-01-13 22:58:01,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:57:58" (2/3) ... [2019-01-13 22:58:01,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e0adad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:58:01, skipping insertion in model container [2019-01-13 22:58:01,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:58:01" (3/3) ... [2019-01-13 22:58:01,196 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2019-01-13 22:58:01,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:58:01,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 88 error locations. [2019-01-13 22:58:01,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2019-01-13 22:58:01,258 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:58:01,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:58:01,259 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:58:01,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:58:01,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:58:01,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:58:01,260 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:58:01,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:58:01,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:58:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-01-13 22:58:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:58:01,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:01,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:01,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 806746755, now seen corresponding path program 1 times [2019-01-13 22:58:01,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:01,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:01,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:01,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:01,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:58:01,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:58:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:58:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:01,760 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2019-01-13 22:58:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:02,204 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-01-13 22:58:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:58:02,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 22:58:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:02,219 INFO L225 Difference]: With dead ends: 83 [2019-01-13 22:58:02,220 INFO L226 Difference]: Without dead ends: 80 [2019-01-13 22:58:02,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-13 22:58:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2019-01-13 22:58:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 22:58:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-01-13 22:58:02,271 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 16 [2019-01-13 22:58:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:02,272 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-01-13 22:58:02,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:58:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-01-13 22:58:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:58:02,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:02,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:02,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:02,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash 806746756, now seen corresponding path program 1 times [2019-01-13 22:58:02,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:02,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:02,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:58:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:58:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:58:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:58:02,789 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 8 states. [2019-01-13 22:58:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:03,201 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2019-01-13 22:58:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:58:03,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 22:58:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:03,204 INFO L225 Difference]: With dead ends: 86 [2019-01-13 22:58:03,205 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 22:58:03,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:58:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 22:58:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2019-01-13 22:58:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 22:58:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-01-13 22:58:03,217 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2019-01-13 22:58:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:03,218 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-01-13 22:58:03,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:58:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-01-13 22:58:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:58:03,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:03,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:03,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1694250436, now seen corresponding path program 1 times [2019-01-13 22:58:03,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:03,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:03,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:58:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:58:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:58:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:03,369 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 5 states. [2019-01-13 22:58:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:03,430 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-01-13 22:58:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:58:03,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 22:58:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:03,433 INFO L225 Difference]: With dead ends: 77 [2019-01-13 22:58:03,433 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 22:58:03,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 22:58:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-01-13 22:58:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 22:58:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-01-13 22:58:03,443 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 16 [2019-01-13 22:58:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-13 22:58:03,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:58:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-01-13 22:58:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 22:58:03,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:03,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:03,445 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -760664780, now seen corresponding path program 1 times [2019-01-13 22:58:03,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:03,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:03,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:03,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:58:03,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:58:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:58:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:03,509 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2019-01-13 22:58:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:03,549 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-01-13 22:58:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:58:03,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 22:58:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:03,551 INFO L225 Difference]: With dead ends: 77 [2019-01-13 22:58:03,551 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 22:58:03,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 22:58:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-01-13 22:58:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 22:58:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-01-13 22:58:03,560 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2019-01-13 22:58:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:03,561 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-01-13 22:58:03,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:58:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-01-13 22:58:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 22:58:03,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:03,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:03,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash 982145555, now seen corresponding path program 1 times [2019-01-13 22:58:03,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:03,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:58:03,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:58:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:58:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:58:03,623 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2019-01-13 22:58:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:03,913 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-01-13 22:58:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:58:03,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-13 22:58:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:03,916 INFO L225 Difference]: With dead ends: 112 [2019-01-13 22:58:03,916 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 22:58:03,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:58:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 22:58:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-01-13 22:58:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:58:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-01-13 22:58:03,926 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 17 [2019-01-13 22:58:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:03,926 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-01-13 22:58:03,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:58:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-01-13 22:58:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 22:58:03,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:03,930 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:03,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -844024092, now seen corresponding path program 1 times [2019-01-13 22:58:03,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:04,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:04,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:04,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:04,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:04,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:58:04,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:04,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:04,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-13 22:58:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:04,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:04,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-13 22:58:04,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 22:58:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 22:58:04,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:58:04,775 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 14 states. [2019-01-13 22:58:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:05,466 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-01-13 22:58:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:58:05,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-01-13 22:58:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:05,468 INFO L225 Difference]: With dead ends: 78 [2019-01-13 22:58:05,468 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 22:58:05,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:58:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 22:58:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-13 22:58:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:58:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-01-13 22:58:05,476 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2019-01-13 22:58:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-01-13 22:58:05,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 22:58:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-01-13 22:58:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:58:05,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:05,478 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:05,478 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1997833244, now seen corresponding path program 1 times [2019-01-13 22:58:05,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:05,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:05,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 22:58:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:58:05,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:58:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:58:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:58:05,600 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 7 states. [2019-01-13 22:58:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:05,837 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-01-13 22:58:05,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:58:05,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-13 22:58:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:05,840 INFO L225 Difference]: With dead ends: 98 [2019-01-13 22:58:05,840 INFO L226 Difference]: Without dead ends: 98 [2019-01-13 22:58:05,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:58:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-13 22:58:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2019-01-13 22:58:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 22:58:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2019-01-13 22:58:05,848 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 27 [2019-01-13 22:58:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:05,848 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2019-01-13 22:58:05,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:58:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2019-01-13 22:58:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:58:05,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:05,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:05,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1997833245, now seen corresponding path program 1 times [2019-01-13 22:58:05,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:05,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:05,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:05,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:06,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:06,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-13 22:58:06,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:58:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:58:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:58:06,191 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 9 states. [2019-01-13 22:58:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:06,364 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-01-13 22:58:06,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:58:06,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-01-13 22:58:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:06,367 INFO L225 Difference]: With dead ends: 82 [2019-01-13 22:58:06,367 INFO L226 Difference]: Without dead ends: 82 [2019-01-13 22:58:06,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:58:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-13 22:58:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-13 22:58:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 22:58:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-01-13 22:58:06,374 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 27 [2019-01-13 22:58:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-01-13 22:58:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:58:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-01-13 22:58:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:58:06,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:06,376 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:06,376 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1610206141, now seen corresponding path program 2 times [2019-01-13 22:58:06,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:06,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:06,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:06,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:06,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:58:06,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:58:06,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:58:06,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-13 22:58:06,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:58:06,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-01-13 22:58:06,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:58:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:58:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:58:06,608 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 9 states. [2019-01-13 22:58:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:06,868 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-01-13 22:58:06,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:58:06,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-13 22:58:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:06,871 INFO L225 Difference]: With dead ends: 108 [2019-01-13 22:58:06,871 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 22:58:06,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:58:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 22:58:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2019-01-13 22:58:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-13 22:58:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-01-13 22:58:06,877 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 30 [2019-01-13 22:58:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:06,877 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-01-13 22:58:06,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:58:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-01-13 22:58:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 22:58:06,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:06,879 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:06,879 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash 821275288, now seen corresponding path program 1 times [2019-01-13 22:58:06,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:06,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:58:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:07,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:07,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:07,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:07,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-13 22:58:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:58:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:58:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:58:07,327 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 13 states. [2019-01-13 22:58:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:07,425 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-13 22:58:07,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:58:07,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-01-13 22:58:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:07,428 INFO L225 Difference]: With dead ends: 89 [2019-01-13 22:58:07,428 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 22:58:07,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:58:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 22:58:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-13 22:58:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-13 22:58:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-01-13 22:58:07,434 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2019-01-13 22:58:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:07,434 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-01-13 22:58:07,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:58:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-01-13 22:58:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 22:58:07,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:07,436 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:07,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1255366392, now seen corresponding path program 2 times [2019-01-13 22:58:07,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:07,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:07,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:58:07,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:58:07,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:58:07,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:07,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:07,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-13 22:58:07,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 22:58:07,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 22:58:07,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:58:07,757 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 15 states. [2019-01-13 22:58:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:07,882 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-01-13 22:58:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:58:07,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-01-13 22:58:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:07,884 INFO L225 Difference]: With dead ends: 92 [2019-01-13 22:58:07,885 INFO L226 Difference]: Without dead ends: 92 [2019-01-13 22:58:07,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:58:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-13 22:58:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-01-13 22:58:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-13 22:58:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2019-01-13 22:58:07,889 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 41 [2019-01-13 22:58:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:07,890 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2019-01-13 22:58:07,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 22:58:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2019-01-13 22:58:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 22:58:07,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:07,891 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:07,892 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1116917400, now seen corresponding path program 3 times [2019-01-13 22:58:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:07,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:58:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:08,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:08,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:58:08,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 22:58:08,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:58:08,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:08,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:58:08,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:08,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:08,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:58:08,586 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2019-01-13 22:58:08,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 22:58:08,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:08,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:08,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-13 22:58:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 2 not checked. [2019-01-13 22:58:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:08,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-01-13 22:58:08,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:58:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:58:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2019-01-13 22:58:08,729 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 17 states. [2019-01-13 22:58:09,438 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 22:58:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:10,289 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2019-01-13 22:58:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 22:58:10,290 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-13 22:58:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:10,292 INFO L225 Difference]: With dead ends: 148 [2019-01-13 22:58:10,292 INFO L226 Difference]: Without dead ends: 148 [2019-01-13 22:58:10,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=705, Unknown=2, NotChecked=56, Total=930 [2019-01-13 22:58:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-13 22:58:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2019-01-13 22:58:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 22:58:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-13 22:58:10,302 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 44 [2019-01-13 22:58:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:10,302 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-13 22:58:10,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:58:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-13 22:58:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 22:58:10,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:10,306 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:10,307 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash -248399111, now seen corresponding path program 1 times [2019-01-13 22:58:10,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:10,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:10,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:10,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:58:10,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:10,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:10,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:10,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:10,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:10,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-13 22:58:10,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 22:58:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 22:58:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:58:10,724 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 19 states. [2019-01-13 22:58:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:10,886 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-01-13 22:58:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:58:10,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-01-13 22:58:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:10,889 INFO L225 Difference]: With dead ends: 107 [2019-01-13 22:58:10,890 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 22:58:10,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:58:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 22:58:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-01-13 22:58:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-13 22:58:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-01-13 22:58:10,896 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 47 [2019-01-13 22:58:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:10,896 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-01-13 22:58:10,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 22:58:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-01-13 22:58:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 22:58:10,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:10,900 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:10,901 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1052314983, now seen corresponding path program 2 times [2019-01-13 22:58:10,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:11,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:11,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:11,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:58:11,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:58:11,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:58:11,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:12,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:12,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-13 22:58:12,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 22:58:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 22:58:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:58:12,208 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 21 states. [2019-01-13 22:58:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:12,314 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2019-01-13 22:58:12,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:58:12,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-01-13 22:58:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:12,317 INFO L225 Difference]: With dead ends: 110 [2019-01-13 22:58:12,317 INFO L226 Difference]: Without dead ends: 110 [2019-01-13 22:58:12,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:58:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-13 22:58:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-13 22:58:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:58:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-13 22:58:12,325 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 50 [2019-01-13 22:58:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:12,325 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-13 22:58:12,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 22:58:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-13 22:58:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 22:58:12,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:12,326 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:12,330 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1772415239, now seen corresponding path program 3 times [2019-01-13 22:58:12,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:12,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:12,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:12,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:58:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:12,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:12,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:58:12,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 22:58:12,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:58:12,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:12,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:58:12,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:12,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:58:12,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:12,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:12,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-01-13 22:58:12,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:12,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-13 22:58:12,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:12,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:12,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:12,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 22:58:12,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:12,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:12,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2019-01-13 22:58:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-13 22:58:12,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:12,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-01-13 22:58:12,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 22:58:12,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 22:58:12,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-01-13 22:58:12,995 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 22 states. [2019-01-13 22:58:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:17,710 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2019-01-13 22:58:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-13 22:58:17,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-01-13 22:58:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:17,714 INFO L225 Difference]: With dead ends: 239 [2019-01-13 22:58:17,715 INFO L226 Difference]: Without dead ends: 239 [2019-01-13 22:58:17,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 22:58:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-13 22:58:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 132. [2019-01-13 22:58:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-13 22:58:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2019-01-13 22:58:17,724 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 53 [2019-01-13 22:58:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:17,725 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2019-01-13 22:58:17,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 22:58:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2019-01-13 22:58:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 22:58:17,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:17,728 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:17,728 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1247532316, now seen corresponding path program 1 times [2019-01-13 22:58:17,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:17,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:17,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:58:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-13 22:58:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:58:17,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:58:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:58:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:17,920 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand 5 states. [2019-01-13 22:58:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:17,945 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2019-01-13 22:58:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:58:17,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-13 22:58:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:17,949 INFO L225 Difference]: With dead ends: 161 [2019-01-13 22:58:17,949 INFO L226 Difference]: Without dead ends: 161 [2019-01-13 22:58:17,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:58:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-13 22:58:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2019-01-13 22:58:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-13 22:58:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2019-01-13 22:58:17,954 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 58 [2019-01-13 22:58:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:17,956 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2019-01-13 22:58:17,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:58:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2019-01-13 22:58:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 22:58:17,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:17,958 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:17,959 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 495278019, now seen corresponding path program 1 times [2019-01-13 22:58:17,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 22:58:18,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:58:18,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:58:18,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:58:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:58:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:58:18,064 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 4 states. [2019-01-13 22:58:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:18,113 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2019-01-13 22:58:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:58:18,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 22:58:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:18,116 INFO L225 Difference]: With dead ends: 141 [2019-01-13 22:58:18,116 INFO L226 Difference]: Without dead ends: 141 [2019-01-13 22:58:18,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:58:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-13 22:58:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2019-01-13 22:58:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-13 22:58:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2019-01-13 22:58:18,127 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 58 [2019-01-13 22:58:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2019-01-13 22:58:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:58:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2019-01-13 22:58:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 22:58:18,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:18,130 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:18,133 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 651130328, now seen corresponding path program 1 times [2019-01-13 22:58:18,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-13 22:58:18,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:18,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:18,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:18,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 22:58:18,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:18,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2019-01-13 22:58:18,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 22:58:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 22:58:18,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:58:18,566 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 15 states. [2019-01-13 22:58:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:19,129 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2019-01-13 22:58:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 22:58:19,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-01-13 22:58:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:19,133 INFO L225 Difference]: With dead ends: 204 [2019-01-13 22:58:19,133 INFO L226 Difference]: Without dead ends: 204 [2019-01-13 22:58:19,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-01-13 22:58:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-13 22:58:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2019-01-13 22:58:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-13 22:58:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-01-13 22:58:19,143 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 61 [2019-01-13 22:58:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:19,143 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-01-13 22:58:19,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 22:58:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-01-13 22:58:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 22:58:19,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:19,148 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:19,148 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 317693874, now seen corresponding path program 1 times [2019-01-13 22:58:19,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 22:58:19,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:19,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:19,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-13 22:58:19,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:58:19,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-01-13 22:58:19,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:58:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:58:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:58:19,427 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 8 states. [2019-01-13 22:58:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:19,676 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2019-01-13 22:58:19,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:58:19,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-01-13 22:58:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:19,680 INFO L225 Difference]: With dead ends: 178 [2019-01-13 22:58:19,680 INFO L226 Difference]: Without dead ends: 178 [2019-01-13 22:58:19,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:58:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-13 22:58:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2019-01-13 22:58:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-13 22:58:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2019-01-13 22:58:19,686 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 65 [2019-01-13 22:58:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2019-01-13 22:58:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:58:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2019-01-13 22:58:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 22:58:19,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:19,687 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:19,693 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 317693875, now seen corresponding path program 1 times [2019-01-13 22:58:19,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:19,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:19,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 22:58:20,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:20,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:20,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 104 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:58:20,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2019-01-13 22:58:20,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 22:58:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 22:58:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-01-13 22:58:20,914 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 24 states. [2019-01-13 22:58:21,748 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-13 22:58:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:22,910 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2019-01-13 22:58:22,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 22:58:22,912 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-01-13 22:58:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:22,914 INFO L225 Difference]: With dead ends: 203 [2019-01-13 22:58:22,914 INFO L226 Difference]: Without dead ends: 203 [2019-01-13 22:58:22,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2019-01-13 22:58:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-13 22:58:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 174. [2019-01-13 22:58:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-13 22:58:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 212 transitions. [2019-01-13 22:58:22,926 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 212 transitions. Word has length 65 [2019-01-13 22:58:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:22,927 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 212 transitions. [2019-01-13 22:58:22,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 22:58:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2019-01-13 22:58:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 22:58:22,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:22,931 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:22,931 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -742952514, now seen corresponding path program 1 times [2019-01-13 22:58:22,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:22,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 22:58:23,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:23,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:23,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:23,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:23,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:23,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 22:58:23,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:24,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-13 22:58:24,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:24,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:24,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-13 22:58:24,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:24,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:24,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 22:58:24,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:24,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-13 22:58:24,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:24,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:24,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-13 22:58:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 108 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:58:24,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:58:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2019-01-13 22:58:24,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 22:58:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 22:58:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-01-13 22:58:24,222 INFO L87 Difference]: Start difference. First operand 174 states and 212 transitions. Second operand 32 states. [2019-01-13 22:58:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:58:29,341 INFO L93 Difference]: Finished difference Result 309 states and 360 transitions. [2019-01-13 22:58:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 22:58:29,343 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-01-13 22:58:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:58:29,346 INFO L225 Difference]: With dead ends: 309 [2019-01-13 22:58:29,346 INFO L226 Difference]: Without dead ends: 309 [2019-01-13 22:58:29,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=413, Invalid=3009, Unknown=0, NotChecked=0, Total=3422 [2019-01-13 22:58:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-13 22:58:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 184. [2019-01-13 22:58:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-13 22:58:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 228 transitions. [2019-01-13 22:58:29,356 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 228 transitions. Word has length 66 [2019-01-13 22:58:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:58:29,356 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 228 transitions. [2019-01-13 22:58:29,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 22:58:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 228 transitions. [2019-01-13 22:58:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 22:58:29,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:58:29,360 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:58:29,361 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:58:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:58:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1258575859, now seen corresponding path program 1 times [2019-01-13 22:58:29,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:58:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:58:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:29,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:58:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 85 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:58:30,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:58:30,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:58:30,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:58:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:58:30,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:58:30,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 22:58:30,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 22:58:30,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2019-01-13 22:58:30,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-13 22:58:30,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-13 22:58:30,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-13 22:58:30,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2019-01-13 22:58:30,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-13 22:58:30,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-01-13 22:58:30,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2019-01-13 22:58:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:30,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-01-13 22:58:30,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:30,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:30,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:62 [2019-01-13 22:58:30,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2019-01-13 22:58:31,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 186 [2019-01-13 22:58:31,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:31,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:31,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:31,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:78 [2019-01-13 22:58:31,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2019-01-13 22:58:31,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:31,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 259 [2019-01-13 22:58:31,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:31,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:31,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:31,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:94 [2019-01-13 22:58:32,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2019-01-13 22:58:32,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:32,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 344 [2019-01-13 22:58:32,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:32,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:32,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:32,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:110 [2019-01-13 22:58:33,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 78 [2019-01-13 22:58:33,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:33,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 441 [2019-01-13 22:58:33,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:34,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:34,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:34,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:130, output treesize:126 [2019-01-13 22:58:36,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 87 [2019-01-13 22:58:36,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:36,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 550 [2019-01-13 22:58:36,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:36,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:36,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:36,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:146, output treesize:142 [2019-01-13 22:58:54,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 96 [2019-01-13 22:58:54,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:58:54,323 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-01-13 22:58:54,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 671 [2019-01-13 22:58:54,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:58:54,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:58:54,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-01-13 22:58:54,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:162, output treesize:158 [2019-01-13 22:59:19,926 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-13 22:59:20,127 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:59:20,128 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-13 22:59:20,134 INFO L168 Benchmark]: Toolchain (without parser) took 82180.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 948.7 MB in the beginning and 770.5 MB in the end (delta: 178.1 MB). Peak memory consumption was 481.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:59:20,135 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:59:20,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -92.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:59:20,136 INFO L168 Benchmark]: Boogie Preprocessor took 123.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:59:20,141 INFO L168 Benchmark]: RCFGBuilder took 2380.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 922.0 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:59:20,142 INFO L168 Benchmark]: TraceAbstraction took 78946.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 914.8 MB in the beginning and 770.5 MB in the end (delta: 144.3 MB). Peak memory consumption was 376.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:59:20,153 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -92.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2380.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 922.0 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78946.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 914.8 MB in the beginning and 770.5 MB in the end (delta: 144.3 MB). Peak memory consumption was 376.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:59:22,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:59:22,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:59:22,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:59:22,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:59:22,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:59:22,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:59:22,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:59:22,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:59:22,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:59:22,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:59:22,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:59:22,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:59:22,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:59:22,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:59:22,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:59:22,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:59:22,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:59:22,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:59:22,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:59:22,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:59:22,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:59:22,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:59:22,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:59:22,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:59:22,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:59:22,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:59:22,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:59:22,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:59:22,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:59:22,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:59:22,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:59:22,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:59:22,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:59:22,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:59:22,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:59:22,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 22:59:22,399 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:59:22,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:59:22,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:59:22,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:59:22,406 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:59:22,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:59:22,406 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:59:22,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:59:22,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:59:22,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:59:22,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:59:22,407 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:59:22,408 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:59:22,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:59:22,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:59:22,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:59:22,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:59:22,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:59:22,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:59:22,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:59:22,412 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:59:22,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:59:22,413 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:59:22,413 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 708e975f6ded0cfba15d7fd51cdde51c174d1f46 [2019-01-13 22:59:22,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:59:22,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:59:22,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:59:22,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:59:22,501 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:59:22,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2019-01-13 22:59:22,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc1dae8e/ce65be8941794360a81005a9d43856f7/FLAG0279aa2cb [2019-01-13 22:59:23,054 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:59:23,055 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2019-01-13 22:59:23,069 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc1dae8e/ce65be8941794360a81005a9d43856f7/FLAG0279aa2cb [2019-01-13 22:59:23,328 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc1dae8e/ce65be8941794360a81005a9d43856f7 [2019-01-13 22:59:23,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:59:23,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:59:23,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:59:23,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:59:23,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:59:23,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:59:23" (1/1) ... [2019-01-13 22:59:23,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3015b02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:23, skipping insertion in model container [2019-01-13 22:59:23,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:59:23" (1/1) ... [2019-01-13 22:59:23,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:59:23,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:59:23,824 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:59:23,853 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:59:23,999 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:59:24,094 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:59:24,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24 WrapperNode [2019-01-13 22:59:24,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:59:24,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:59:24,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:59:24,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:59:24,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... [2019-01-13 22:59:24,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:59:24,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:59:24,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:59:24,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:59:24,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:59:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-13 22:59:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-13 22:59:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-13 22:59:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-13 22:59:24,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-13 22:59:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-13 22:59:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-13 22:59:24,271 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:59:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:59:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:59:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:59:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:59:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:59:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:59:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:59:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:59:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:59:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:59:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:59:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:59:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:59:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:59:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:59:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:59:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:59:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-13 22:59:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-13 22:59:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-13 22:59:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 22:59:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-13 22:59:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-13 22:59:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:59:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:59:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:59:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-13 22:59:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-13 22:59:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-01-13 22:59:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-01-13 22:59:25,059 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 22:59:25,960 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 22:59:27,316 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:59:27,317 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-13 22:59:27,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:59:27 BoogieIcfgContainer [2019-01-13 22:59:27,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:59:27,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:59:27,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:59:27,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:59:27,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:59:23" (1/3) ... [2019-01-13 22:59:27,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a8aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:59:27, skipping insertion in model container [2019-01-13 22:59:27,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:59:24" (2/3) ... [2019-01-13 22:59:27,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a8aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:59:27, skipping insertion in model container [2019-01-13 22:59:27,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:59:27" (3/3) ... [2019-01-13 22:59:27,328 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2019-01-13 22:59:27,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:59:27,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 88 error locations. [2019-01-13 22:59:27,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2019-01-13 22:59:27,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:59:27,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:59:27,390 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:59:27,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:59:27,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:59:27,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:59:27,391 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:59:27,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:59:27,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:59:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-01-13 22:59:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:59:27,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:27,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:27,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 471887971, now seen corresponding path program 1 times [2019-01-13 22:59:27,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:27,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-13 22:59:27,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:27,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:27,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:59:27,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:59:27,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:59:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:59:27,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:27,686 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2019-01-13 22:59:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:27,813 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-13 22:59:27,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:59:27,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 22:59:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:27,828 INFO L225 Difference]: With dead ends: 79 [2019-01-13 22:59:27,828 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 22:59:27,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 22:59:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-01-13 22:59:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:59:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2019-01-13 22:59:27,876 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 16 [2019-01-13 22:59:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:27,877 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2019-01-13 22:59:27,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:59:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2019-01-13 22:59:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:59:27,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:27,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:27,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -415615710, now seen corresponding path program 1 times [2019-01-13 22:59:27,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:27,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:27,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:27,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:27,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:27,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:28,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:28,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:59:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:28,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:59:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:59:28,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:59:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:59:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:28,082 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 5 states. [2019-01-13 22:59:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:28,694 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-13 22:59:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:59:28,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 22:59:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:28,697 INFO L225 Difference]: With dead ends: 75 [2019-01-13 22:59:28,697 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 22:59:28,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 22:59:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-13 22:59:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:59:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-01-13 22:59:28,708 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 16 [2019-01-13 22:59:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:28,709 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-01-13 22:59:28,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:59:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-01-13 22:59:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:59:28,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:28,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:28,711 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -415615709, now seen corresponding path program 1 times [2019-01-13 22:59:28,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:28,714 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:28,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:28,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:28,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:28,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:28,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:59:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:28,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:59:28,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:28,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:59:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:59:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:59:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:59:28,984 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 8 states. [2019-01-13 22:59:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:29,461 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-01-13 22:59:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:59:29,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 22:59:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:29,466 INFO L225 Difference]: With dead ends: 78 [2019-01-13 22:59:29,466 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 22:59:29,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:59:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 22:59:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-01-13 22:59:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 22:59:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-01-13 22:59:29,476 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 16 [2019-01-13 22:59:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:29,477 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-13 22:59:29,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:59:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-01-13 22:59:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 22:59:29,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:29,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:29,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1743614811, now seen corresponding path program 1 times [2019-01-13 22:59:29,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:29,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:29,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:29,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:59:29,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:29,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:59:29,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:59:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:59:29,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:59:29,553 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 3 states. [2019-01-13 22:59:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:29,874 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2019-01-13 22:59:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:59:29,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-13 22:59:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:29,877 INFO L225 Difference]: With dead ends: 112 [2019-01-13 22:59:29,878 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 22:59:29,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:59:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 22:59:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-01-13 22:59:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:59:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-01-13 22:59:29,889 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 17 [2019-01-13 22:59:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:29,889 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-01-13 22:59:29,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:59:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-01-13 22:59:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 22:59:29,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:29,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:29,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 804476, now seen corresponding path program 1 times [2019-01-13 22:59:29,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:29,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:29,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:30,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:59:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:59:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:59:30,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:59:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:30,007 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 5 states. [2019-01-13 22:59:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:30,241 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-01-13 22:59:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:59:30,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 22:59:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:30,244 INFO L225 Difference]: With dead ends: 73 [2019-01-13 22:59:30,245 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 22:59:30,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 22:59:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-13 22:59:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 22:59:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-01-13 22:59:30,252 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 17 [2019-01-13 22:59:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:30,252 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-01-13 22:59:30,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:59:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-01-13 22:59:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 22:59:30,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:30,254 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:30,256 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 783489835, now seen corresponding path program 1 times [2019-01-13 22:59:30,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:30,257 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:30,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:30,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:30,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:30,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:30,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:59:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:30,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:31,970 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-13 22:59:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:32,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:59:32,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-01-13 22:59:32,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:59:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:59:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:59:32,399 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 17 states. [2019-01-13 22:59:33,857 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-13 22:59:34,327 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-13 22:59:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:34,983 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2019-01-13 22:59:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:59:34,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-01-13 22:59:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:34,985 INFO L225 Difference]: With dead ends: 86 [2019-01-13 22:59:34,985 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 22:59:34,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-01-13 22:59:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 22:59:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2019-01-13 22:59:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-13 22:59:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-01-13 22:59:34,994 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2019-01-13 22:59:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:34,994 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-01-13 22:59:34,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:59:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-01-13 22:59:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:59:34,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:34,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:34,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 271455331, now seen corresponding path program 1 times [2019-01-13 22:59:35,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:35,000 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:59:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:35,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:35,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:35,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:59:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-13 22:59:35,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:59:35,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:59:35,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:59:35,278 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 10 states. [2019-01-13 22:59:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:35,672 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-13 22:59:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:59:35,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-01-13 22:59:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:35,675 INFO L225 Difference]: With dead ends: 88 [2019-01-13 22:59:35,675 INFO L226 Difference]: Without dead ends: 88 [2019-01-13 22:59:35,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:59:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-13 22:59:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-01-13 22:59:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-13 22:59:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-01-13 22:59:35,683 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 27 [2019-01-13 22:59:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:35,683 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-01-13 22:59:35,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:59:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-01-13 22:59:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:59:35,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:35,686 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:35,687 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 136821539, now seen corresponding path program 2 times [2019-01-13 22:59:35,687 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:35,713 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 22:59:35,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:59:35,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:59:35,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:35,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:35,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:35,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:35,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:59:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:36,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (9)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:59:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:59:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-01-13 22:59:37,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 22:59:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 22:59:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-01-13 22:59:37,850 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 22 states. [2019-01-13 22:59:39,565 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-01-13 22:59:39,810 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-13 22:59:40,151 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-13 22:59:41,265 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-13 22:59:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:42,499 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2019-01-13 22:59:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 22:59:42,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-01-13 22:59:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:42,502 INFO L225 Difference]: With dead ends: 106 [2019-01-13 22:59:42,502 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 22:59:42,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 22:59:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 22:59:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-01-13 22:59:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 22:59:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-01-13 22:59:42,511 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 28 [2019-01-13 22:59:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:42,512 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-01-13 22:59:42,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 22:59:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-01-13 22:59:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 22:59:42,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:42,514 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:42,515 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 95473251, now seen corresponding path program 2 times [2019-01-13 22:59:42,516 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:42,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:59:42,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:59:42,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:59:42,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-13 22:59:42,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (10)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:59:42,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:42,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:59:42,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:59:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:59:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:59:42,645 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 4 states. [2019-01-13 22:59:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:42,798 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-01-13 22:59:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:59:42,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-13 22:59:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:42,801 INFO L225 Difference]: With dead ends: 113 [2019-01-13 22:59:42,801 INFO L226 Difference]: Without dead ends: 113 [2019-01-13 22:59:42,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-13 22:59:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2019-01-13 22:59:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 22:59:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-01-13 22:59:42,809 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2019-01-13 22:59:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:42,810 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-01-13 22:59:42,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:59:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-01-13 22:59:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 22:59:42,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:42,813 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:42,813 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1804137271, now seen corresponding path program 1 times [2019-01-13 22:59:42,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:42,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:42,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:59:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:42,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:43,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (11)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:59:43,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:59:43,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-13 22:59:43,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 22:59:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 22:59:43,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:59:43,445 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 18 states. [2019-01-13 22:59:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:44,094 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2019-01-13 22:59:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:59:44,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-01-13 22:59:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:44,105 INFO L225 Difference]: With dead ends: 106 [2019-01-13 22:59:44,105 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 22:59:44,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:59:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 22:59:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-13 22:59:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 22:59:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-13 22:59:44,119 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 44 [2019-01-13 22:59:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:44,120 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-13 22:59:44,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 22:59:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-13 22:59:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 22:59:44,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:44,126 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:44,126 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -908778461, now seen corresponding path program 3 times [2019-01-13 22:59:44,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:44,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-13 22:59:44,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-13 22:59:44,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:59:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:44,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:44,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:44,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:44,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:59:45,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-01-13 22:59:45,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:45,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:45,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:7 [2019-01-13 22:59:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:45,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:46,425 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-01-13 22:59:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:59:51,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:59:51,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2019-01-13 22:59:51,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-13 22:59:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-13 22:59:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2019-01-13 22:59:51,461 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 41 states. [2019-01-13 22:59:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:56,467 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2019-01-13 22:59:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 22:59:56,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2019-01-13 22:59:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:56,470 INFO L225 Difference]: With dead ends: 106 [2019-01-13 22:59:56,470 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 22:59:56,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=309, Invalid=1671, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 22:59:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 22:59:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-01-13 22:59:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 22:59:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-13 22:59:56,479 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 46 [2019-01-13 22:59:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:56,479 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-13 22:59:56,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-13 22:59:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-13 22:59:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 22:59:56,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:56,485 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:56,487 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:56,487 INFO L82 PathProgramCache]: Analyzing trace with hash -393119433, now seen corresponding path program 2 times [2019-01-13 22:59:56,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:56,488 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:56,540 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 22:59:56,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:59:56,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:59:56,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-13 22:59:56,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:59:56,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:59:56,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:59:56,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:59:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:59:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:56,646 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 5 states. [2019-01-13 22:59:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:56,676 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2019-01-13 22:59:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:59:56,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-13 22:59:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:56,680 INFO L225 Difference]: With dead ends: 125 [2019-01-13 22:59:56,680 INFO L226 Difference]: Without dead ends: 125 [2019-01-13 22:59:56,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:59:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-13 22:59:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2019-01-13 22:59:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:59:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-13 22:59:56,684 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 56 [2019-01-13 22:59:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:56,684 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-13 22:59:56,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:59:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-13 22:59:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 22:59:56,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:56,687 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:56,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash -421748584, now seen corresponding path program 1 times [2019-01-13 22:59:56,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:56,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:59:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:59:56,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:59:56,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 22:59:56,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:56,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:59:56,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:59:57,569 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2019-01-13 22:59:57,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 22:59:57,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:59:57,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:59:57,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-13 22:59:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-13 22:59:57,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:59:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-13 22:59:57,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:59:57,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2019-01-13 22:59:57,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:59:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:59:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=51, Unknown=7, NotChecked=14, Total=90 [2019-01-13 22:59:57,966 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 10 states. [2019-01-13 22:59:59,168 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-13 22:59:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:59:59,817 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-01-13 22:59:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:59:59,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-13 22:59:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:59:59,819 INFO L225 Difference]: With dead ends: 143 [2019-01-13 22:59:59,820 INFO L226 Difference]: Without dead ends: 143 [2019-01-13 22:59:59,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=48, Invalid=153, Unknown=13, NotChecked=26, Total=240 [2019-01-13 22:59:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-13 22:59:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2019-01-13 22:59:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 22:59:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-13 22:59:59,825 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 56 [2019-01-13 22:59:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:59:59,827 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-13 22:59:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:59:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-13 22:59:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 22:59:59,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:59:59,829 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:59:59,829 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 22:59:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:59:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash -421748583, now seen corresponding path program 1 times [2019-01-13 22:59:59,830 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:59:59,830 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:59:59,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:00,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:00,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:00,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:00,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:00,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:00,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:00,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:00:01,642 WARN L860 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2019-01-13 23:00:01,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:01,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:01,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-13 23:00:01,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:01,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:01,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:01,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:01,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2019-01-13 23:00:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-13 23:00:01,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:02,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:00:02,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:00:02,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:02,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:02,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:02,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:00:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:02,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:02,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:00:02,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:02,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:02,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-01-13 23:00:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-13 23:00:02,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:02,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-13 23:00:02,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:00:02,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:00:02,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2019-01-13 23:00:02,723 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 12 states. [2019-01-13 23:00:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:03,988 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2019-01-13 23:00:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 23:00:03,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-01-13 23:00:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:03,991 INFO L225 Difference]: With dead ends: 137 [2019-01-13 23:00:03,991 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 23:00:03,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2019-01-13 23:00:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 23:00:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2019-01-13 23:00:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-13 23:00:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2019-01-13 23:00:03,999 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 56 [2019-01-13 23:00:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:03,999 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2019-01-13 23:00:03,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:00:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2019-01-13 23:00:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:00:04,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:04,000 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:04,001 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2024373687, now seen corresponding path program 1 times [2019-01-13 23:00:04,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:04,006 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:04,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 23:00:04,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (17)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:00:04,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:00:04,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:00:04,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:00:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:00:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:00:04,317 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 5 states. [2019-01-13 23:00:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:04,469 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-01-13 23:00:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:00:04,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-13 23:00:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:04,472 INFO L225 Difference]: With dead ends: 132 [2019-01-13 23:00:04,472 INFO L226 Difference]: Without dead ends: 127 [2019-01-13 23:00:04,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:00:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-13 23:00:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-01-13 23:00:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-13 23:00:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2019-01-13 23:00:04,479 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 58 [2019-01-13 23:00:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:04,480 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-01-13 23:00:04,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:00:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2019-01-13 23:00:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 23:00:04,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:04,481 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:04,483 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 501254750, now seen corresponding path program 1 times [2019-01-13 23:00:04,484 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:04,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:04,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:04,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 23:00:04,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 23:00:04,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:04,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-13 23:00:04,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:00:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:00:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:00:04,856 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 10 states. [2019-01-13 23:00:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:05,140 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2019-01-13 23:00:05,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:00:05,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-01-13 23:00:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:05,144 INFO L225 Difference]: With dead ends: 197 [2019-01-13 23:00:05,145 INFO L226 Difference]: Without dead ends: 197 [2019-01-13 23:00:05,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:00:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-13 23:00:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 137. [2019-01-13 23:00:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-13 23:00:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-01-13 23:00:05,153 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 61 [2019-01-13 23:00:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:05,154 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-01-13 23:00:05,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:00:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-01-13 23:00:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:00:05,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:05,156 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:05,157 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 985256632, now seen corresponding path program 1 times [2019-01-13 23:00:05,158 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:05,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:05,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:05,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:05,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:05,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:00:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 23:00:05,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:05,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:00:05,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:00:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:05,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:05,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:05,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:05,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:05,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:00:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 23:00:05,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:05,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:05,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-13 23:00:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:00:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:00:05,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=50, Unknown=6, NotChecked=0, Total=72 [2019-01-13 23:00:05,861 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 8 states. [2019-01-13 23:00:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:06,453 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2019-01-13 23:00:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:00:06,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-01-13 23:00:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:06,455 INFO L225 Difference]: With dead ends: 159 [2019-01-13 23:00:06,455 INFO L226 Difference]: Without dead ends: 159 [2019-01-13 23:00:06,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=89, Unknown=9, NotChecked=0, Total=132 [2019-01-13 23:00:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-13 23:00:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2019-01-13 23:00:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-13 23:00:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2019-01-13 23:00:06,461 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 65 [2019-01-13 23:00:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:06,461 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2019-01-13 23:00:06,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:00:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2019-01-13 23:00:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:00:06,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:06,462 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:06,465 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash 985256633, now seen corresponding path program 1 times [2019-01-13 23:00:06,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:06,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:06,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:06,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:06,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:06,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:06,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:06,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:00:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 23:00:06,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:07,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:00:07,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:00:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:07,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:07,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:07,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:07,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:07,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:00:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-13 23:00:07,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:08,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:08,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-13 23:00:08,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:00:08,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:00:08,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:00:08,504 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 10 states. [2019-01-13 23:00:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:09,419 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2019-01-13 23:00:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:00:09,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-13 23:00:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:09,424 INFO L225 Difference]: With dead ends: 169 [2019-01-13 23:00:09,424 INFO L226 Difference]: Without dead ends: 169 [2019-01-13 23:00:09,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-01-13 23:00:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-13 23:00:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 148. [2019-01-13 23:00:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-13 23:00:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2019-01-13 23:00:09,432 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 65 [2019-01-13 23:00:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:09,432 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2019-01-13 23:00:09,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:00:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2019-01-13 23:00:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:00:09,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:09,433 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:09,434 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -522295177, now seen corresponding path program 1 times [2019-01-13 23:00:09,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:09,436 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:09,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:09,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-13 23:00:09,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (23)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:00:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:00:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:00:09,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:00:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:00:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:00:09,582 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand 5 states. [2019-01-13 23:00:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:09,633 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2019-01-13 23:00:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:00:09,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-13 23:00:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:09,637 INFO L225 Difference]: With dead ends: 163 [2019-01-13 23:00:09,637 INFO L226 Difference]: Without dead ends: 163 [2019-01-13 23:00:09,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:00:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-13 23:00:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-01-13 23:00:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-13 23:00:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2019-01-13 23:00:09,648 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 65 [2019-01-13 23:00:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:09,648 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2019-01-13 23:00:09,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:00:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2019-01-13 23:00:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:00:09,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:09,650 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:09,651 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 478184883, now seen corresponding path program 1 times [2019-01-13 23:00:09,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:09,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:10,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:10,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 23:00:10,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:00:10,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-13 23:00:10,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-13 23:00:10,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-13 23:00:10,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-13 23:00:10,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-01-13 23:00:10,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2019-01-13 23:00:10,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-01-13 23:00:10,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-01-13 23:00:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 109 [2019-01-13 23:00:10,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-01-13 23:00:10,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-13 23:00:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:10,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2019-01-13 23:00:10,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:10,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-01-13 23:00:11,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2019-01-13 23:00:11,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 193 [2019-01-13 23:00:11,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-01-13 23:00:11,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59 [2019-01-13 23:00:11,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 274 [2019-01-13 23:00:11,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:11,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-01-13 23:00:11,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2019-01-13 23:00:11,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,092 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-13 23:00:12,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 369 [2019-01-13 23:00:12,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2019-01-13 23:00:12,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 67 [2019-01-13 23:00:12,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:12,678 INFO L303 Elim1Store]: Index analysis took 171 ms [2019-01-13 23:00:12,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2019-01-13 23:00:12,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:12,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-01-13 23:00:13,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2019-01-13 23:00:13,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:13,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2019-01-13 23:00:13,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:13,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:13,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:13,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-01-13 23:00:14,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2019-01-13 23:00:14,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2019-01-13 23:00:14,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:14,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:14,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:14,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2019-01-13 23:00:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 23:00:14,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:14,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:00:14,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:00:14,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:14,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:14,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:14,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:14,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:14,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:00:15,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 23:00:15,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:00:15,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-13 23:00:15,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-13 23:00:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:15,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-13 23:00:15,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39 [2019-01-13 23:00:15,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2019-01-13 23:00:15,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-13 23:00:15,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:15,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:15,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:15,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2019-01-13 23:00:15,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:15,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2019-01-13 23:00:16,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:16,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,148 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:16,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:16,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:16,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,366 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:16,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:16,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:16,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:16,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,588 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:16,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:16,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:16,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:16,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:16,809 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:16,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:16,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:16,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:17,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:17,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,033 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:17,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:17,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:17,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:17,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,265 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:17,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:17,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:17,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-01-13 23:00:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:17,493 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-13 23:00:17,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:00:17,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:00:17,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-13 23:00:17,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2019-01-13 23:00:17,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:17,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2019-01-13 23:00:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-13 23:00:17,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:18,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2019-01-13 23:00:18,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-13 23:00:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-13 23:00:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 23:00:18,509 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand 42 states. [2019-01-13 23:00:25,183 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-13 23:00:26,060 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-13 23:00:26,415 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-13 23:00:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:28,019 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2019-01-13 23:00:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-13 23:00:28,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2019-01-13 23:00:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:28,022 INFO L225 Difference]: With dead ends: 162 [2019-01-13 23:00:28,022 INFO L226 Difference]: Without dead ends: 162 [2019-01-13 23:00:28,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=507, Invalid=5813, Unknown=0, NotChecked=0, Total=6320 [2019-01-13 23:00:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-13 23:00:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 145. [2019-01-13 23:00:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-13 23:00:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-01-13 23:00:28,030 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 66 [2019-01-13 23:00:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:28,030 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-01-13 23:00:28,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-13 23:00:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-01-13 23:00:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:00:28,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:28,031 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:28,032 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash -606287137, now seen corresponding path program 1 times [2019-01-13 23:00:28,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:28,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:28,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:28,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:28,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:28,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:28,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:28,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:28,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:00:29,963 WARN L860 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2019-01-13 23:00:29,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:29,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:29,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:00:30,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-01-13 23:00:30,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:00:30,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:30,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-01-13 23:00:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2019-01-13 23:00:30,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:30,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:00:30,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:00:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:00:30,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:00:30,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:30,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:00:30,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:00:30,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:30,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-13 23:00:30,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:30,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:30,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:31,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:31,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2019-01-13 23:00:31,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:31,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:00:31,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:00:31,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:31,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:00:31,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:00:31,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:00:31,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-01-13 23:00:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2019-01-13 23:00:31,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:00:31,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:00:31,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-13 23:00:31,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 23:00:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 23:00:31,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2019-01-13 23:00:31,415 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 14 states. [2019-01-13 23:00:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:00:33,427 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2019-01-13 23:00:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 23:00:33,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-01-13 23:00:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:00:33,430 INFO L225 Difference]: With dead ends: 183 [2019-01-13 23:00:33,430 INFO L226 Difference]: Without dead ends: 183 [2019-01-13 23:00:33,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=70, Invalid=395, Unknown=1, NotChecked=40, Total=506 [2019-01-13 23:00:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-13 23:00:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2019-01-13 23:00:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-13 23:00:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2019-01-13 23:00:33,436 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 66 [2019-01-13 23:00:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:00:33,437 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2019-01-13 23:00:33,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 23:00:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2019-01-13 23:00:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 23:00:33,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:00:33,438 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:00:33,438 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:00:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:00:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1938829912, now seen corresponding path program 1 times [2019-01-13 23:00:33,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:00:33,439 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:00:33,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:00:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:00:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:00:35,169 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:00:35,224 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-13 23:00:35,226 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-13 23:00:35,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:00:35 BoogieIcfgContainer [2019-01-13 23:00:35,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:00:35,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:00:35,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:00:35,268 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:00:35,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:59:27" (3/4) ... [2019-01-13 23:00:35,284 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 23:00:35,320 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-13 23:00:35,324 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-13 23:00:35,413 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 23:00:35,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:00:35,415 INFO L168 Benchmark]: Toolchain (without parser) took 72083.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.3 MB). Free memory was 946.0 MB in the beginning and 867.8 MB in the end (delta: 78.2 MB). Peak memory consumption was 483.5 MB. Max. memory is 11.5 GB. [2019-01-13 23:00:35,416 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:00:35,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:00:35,417 INFO L168 Benchmark]: Boogie Preprocessor took 107.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:00:35,417 INFO L168 Benchmark]: RCFGBuilder took 3114.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 957.8 MB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 11.5 GB. [2019-01-13 23:00:35,417 INFO L168 Benchmark]: TraceAbstraction took 67947.51 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 289.4 MB). Free memory was 957.8 MB in the beginning and 867.8 MB in the end (delta: 90.1 MB). Peak memory consumption was 379.5 MB. Max. memory is 11.5 GB. [2019-01-13 23:00:35,417 INFO L168 Benchmark]: Witness Printer took 146.56 ms. Allocated memory is still 1.4 GB. Free memory was 867.8 MB in the beginning and 867.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 23:00:35,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3114.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 957.8 MB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67947.51 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 289.4 MB). Free memory was 957.8 MB in the beginning and 867.8 MB in the end (delta: 90.1 MB). Peak memory consumption was 379.5 MB. Max. memory is 11.5 GB. * Witness Printer took 146.56 ms. Allocated memory is still 1.4 GB. Free memory was 867.8 MB in the beginning and 867.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1460]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={1073741822:0}] [L1478] CALL entry_point() VAL [ldv_global_msg_list={1073741822:0}] [L1465] int i; [L1466] int len = 10; VAL [ldv_global_msg_list={1073741822:0}, len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40, ldv_global_msg_list={1073741822:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={1610612735:0}, ldv_global_msg_list={1073741822:0}, malloc(size)={1610612735:0}, size=40] [L1467] RET, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_global_msg_list={1073741822:0}, ldv_malloc(sizeof(struct A17*)*len)={1610612735:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE !(!array) [L1469] i=0 VAL [array={1610612735:0}, i=0, ldv_global_msg_list={1073741822:0}, len=10] [L1469] COND TRUE i=0) VAL [\old(len)=10, array={1610612735:0}, array={1610612735:0}, i=0, j=4294967295, ldv_global_msg_list={1073741822:0}, len=10, p={0:0}] [L1454] return - -3; VAL [\old(len)=10, \result=3, array={1610612735:0}, array={1610612735:0}, i=0, j=4294967295, ldv_global_msg_list={1073741822:0}, len=10, p={0:0}] [L1472] RET alloc_unsafe_17(array, len) VAL [alloc_unsafe_17(array, len)=3, array={1610612735:0}, i=10, ldv_global_msg_list={1073741822:0}, len=10] [L1473] CALL free_17(array, len) VAL [\old(len)=10, array={1610612735:0}, ldv_global_msg_list={1073741822:0}] [L1458] int i; [L1459] i=0 VAL [\old(len)=10, array={1610612735:0}, array={1610612735:0}, i=0, ldv_global_msg_list={1073741822:0}, len=10] [L1459] COND TRUE i